./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:15:53,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:15:53,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:15:53,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:15:53,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:15:53,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:15:53,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:15:53,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:15:53,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:15:53,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:15:53,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:15:53,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:15:53,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:15:53,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:15:53,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:15:53,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:15:53,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:15:53,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:15:53,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:15:53,998 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:15:53,999 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 -> cf0e38c8708298b6c669a06e84f1e143a32d8eb782624bd4425e7da323fbf6a8 [2025-03-17 07:15:54,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:15:54,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:15:54,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:15:54,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:15:54,271 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:15:54,274 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_begin_harness_negated.i [2025-03-17 07:15:55,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491009e27/e0e779805eda420bb7229f2146b00ad9/FLAG5196b5ed0 [2025-03-17 07:15:55,915 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:15:55,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_begin_harness_negated.i [2025-03-17 07:15:55,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491009e27/e0e779805eda420bb7229f2146b00ad9/FLAG5196b5ed0 [2025-03-17 07:15:56,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491009e27/e0e779805eda420bb7229f2146b00ad9 [2025-03-17 07:15:56,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:15:56,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:15:56,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:15:56,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:15:56,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:15:56,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:15:56" (1/1) ... [2025-03-17 07:15:56,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64fbf5c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:56, skipping insertion in model container [2025-03-17 07:15:56,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:15:56" (1/1) ... [2025-03-17 07:15:56,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:15:56,290 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_begin_harness_negated.i[4495,4508] [2025-03-17 07:15:56,296 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_begin_harness_negated.i[4555,4568] [2025-03-17 07:15:56,710 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,714 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,715 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,715 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,727 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,732 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,733 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,735 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:56,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,011 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_begin_harness_negated.i[150686,150699] [2025-03-17 07:15:57,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:15:57,026 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:15:57,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_begin_harness_negated.i[4495,4508] [2025-03-17 07:15:57,036 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_begin_harness_negated.i[4555,4568] [2025-03-17 07:15:57,086 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,086 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,086 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,087 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,087 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,093 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,094 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,094 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,094 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,095 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,095 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,096 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,096 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:57,173 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_begin_harness_negated.i[150686,150699] [2025-03-17 07:15:57,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:15:57,299 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:15:57,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57 WrapperNode [2025-03-17 07:15:57,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:15:57,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:15:57,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:15:57,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:15:57,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,394 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 137 [2025-03-17 07:15:57,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:15:57,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:15:57,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:15:57,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:15:57,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,420 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-17 07:15:57,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:15:57,447 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:15:57,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:15:57,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:15:57,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (1/1) ... [2025-03-17 07:15:57,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:15:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:57,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 07:15:57,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 07:15:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:15:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:15:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-17 07:15:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:15:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:15:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:15:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-17 07:15:57,494 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:15:57,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:15:57,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:15:57,689 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:15:57,734 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-17 07:15:57,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-17 07:15:57,871 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-17 07:15:57,890 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-17 07:15:57,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:15:57,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:15:57,902 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:15:57,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:15:57 BoogieIcfgContainer [2025-03-17 07:15:57,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:15:57,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:15:57,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:15:57,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:15:57,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:15:56" (1/3) ... [2025-03-17 07:15:57,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b8e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:15:57, skipping insertion in model container [2025-03-17 07:15:57,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:57" (2/3) ... [2025-03-17 07:15:57,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b8e517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:15:57, skipping insertion in model container [2025-03-17 07:15:57,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:15:57" (3/3) ... [2025-03-17 07:15:57,910 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_begin_harness_negated.i [2025-03-17 07:15:57,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:15:57,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_begin_harness_negated.i that has 6 procedures, 63 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-17 07:15:57,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:15:57,962 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;@7eab9364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:15:57,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:15:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 07:15:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 07:15:57,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:57,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-17 07:15:57,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1485045053, now seen corresponding path program 1 times [2025-03-17 07:15:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770628143] [2025-03-17 07:15:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:58,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 07:15:58,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 07:15:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 07:15:58,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770628143] [2025-03-17 07:15:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770628143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:15:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050457182] [2025-03-17 07:15:58,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:58,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:58,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:15:58,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 07:15:58,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 07:15:58,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 07:15:58,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:58,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 07:15:58,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:15:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 07:15:58,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:15:58,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050457182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:58,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:15:58,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 07:15:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851501665] [2025-03-17 07:15:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:15:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:58,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:15:58,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:15:58,485 INFO L87 Difference]: Start difference. First operand has 63 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:15:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:58,499 INFO L93 Difference]: Finished difference Result 119 states and 167 transitions. [2025-03-17 07:15:58,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:15:58,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-17 07:15:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:58,504 INFO L225 Difference]: With dead ends: 119 [2025-03-17 07:15:58,504 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 07:15:58,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:15:58,508 INFO L435 NwaCegarLoop]: 82 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, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:58,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:15:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 07:15:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-17 07:15:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 07:15:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2025-03-17 07:15:58,534 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 68 [2025-03-17 07:15:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:58,534 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2025-03-17 07:15:58,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:15:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2025-03-17 07:15:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 07:15:58,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:58,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-17 07:15:58,543 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:15:58,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 07:15:58,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:58,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:58,738 INFO L85 PathProgramCache]: Analyzing trace with hash 288797826, now seen corresponding path program 1 times [2025-03-17 07:15:58,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:58,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601537] [2025-03-17 07:15:58,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:58,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:58,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 07:15:58,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 07:15:58,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:58,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-17 07:15:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601537] [2025-03-17 07:15:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:59,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:59,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:15:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018120986] [2025-03-17 07:15:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:59,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:15:59,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:59,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:15:59,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:15:59,305 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 07:15:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:59,365 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2025-03-17 07:15:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:15:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-03-17 07:15:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:59,368 INFO L225 Difference]: With dead ends: 70 [2025-03-17 07:15:59,368 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 07:15:59,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:15:59,368 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:59,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 372 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:15:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 07:15:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-17 07:15:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 07:15:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2025-03-17 07:15:59,383 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 68 [2025-03-17 07:15:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:59,383 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-03-17 07:15:59,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-17 07:15:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2025-03-17 07:15:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 07:15:59,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:59,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-17 07:15:59,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:15:59,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:59,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1236493576, now seen corresponding path program 1 times [2025-03-17 07:15:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:59,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054626906] [2025-03-17 07:15:59,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:59,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:59,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 07:15:59,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 07:15:59,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:59,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 07:15:59,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:59,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054626906] [2025-03-17 07:15:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054626906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:15:59,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611782249] [2025-03-17 07:15:59,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:59,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:59,793 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:15:59,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 07:15:59,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 07:15:59,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 07:15:59,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:59,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:59,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 07:15:59,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:16:00,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611782249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-03-17 07:16:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201077606] [2025-03-17 07:16:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:00,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:16:00,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:16:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 07:16:00,049 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:16:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:00,132 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2025-03-17 07:16:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:00,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-17 07:16:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:00,135 INFO L225 Difference]: With dead ends: 129 [2025-03-17 07:16:00,135 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 07:16:00,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 07:16:00,136 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 20 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:00,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 333 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:00,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 07:16:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-03-17 07:16:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 07:16:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2025-03-17 07:16:00,146 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 69 [2025-03-17 07:16:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2025-03-17 07:16:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:16:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2025-03-17 07:16:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 07:16:00,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:00,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-17 07:16:00,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 07:16:00,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 07:16:00,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:00,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash -524117376, now seen corresponding path program 1 times [2025-03-17 07:16:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051862907] [2025-03-17 07:16:00,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:00,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 07:16:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 07:16:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 07:16:00,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:00,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051862907] [2025-03-17 07:16:00,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051862907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:00,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934815155] [2025-03-17 07:16:00,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:00,654 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:16:00,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 07:16:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 07:16:00,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 07:16:00,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:00,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:00,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 07:16:00,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:16:00,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:00,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934815155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:00,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:00,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-17 07:16:00,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796646312] [2025-03-17 07:16:00,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:00,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:00,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:00,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:00,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 07:16:00,907 INFO L87 Difference]: Start difference. First operand 67 states and 88 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:16:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:01,024 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2025-03-17 07:16:01,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-17 07:16:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:01,026 INFO L225 Difference]: With dead ends: 135 [2025-03-17 07:16:01,026 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 07:16:01,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-17 07:16:01,027 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 29 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:01,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 374 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 07:16:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2025-03-17 07:16:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 48 states have internal predecessors, (58), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 07:16:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-03-17 07:16:01,033 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 71 [2025-03-17 07:16:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:01,033 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-03-17 07:16:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:16:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2025-03-17 07:16:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 07:16:01,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:01,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-17 07:16:01,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 07:16:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:01,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1970294899, now seen corresponding path program 1 times [2025-03-17 07:16:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87867202] [2025-03-17 07:16:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:01,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 07:16:01,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 07:16:01,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:01,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:16:01,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:01,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87867202] [2025-03-17 07:16:01,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87867202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:01,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:01,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:01,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417874607] [2025-03-17 07:16:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:01,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:01,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:01,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:01,474 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:16:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:01,574 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2025-03-17 07:16:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:16:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-03-17 07:16:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:01,576 INFO L225 Difference]: With dead ends: 136 [2025-03-17 07:16:01,576 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 07:16:01,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:01,577 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:01,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 381 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 07:16:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2025-03-17 07:16:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-17 07:16:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-17 07:16:01,583 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 72 [2025-03-17 07:16:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:01,583 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-17 07:16:01,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-17 07:16:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-17 07:16:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 07:16:01,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:01,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-17 07:16:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:16:01,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1876903756, now seen corresponding path program 1 times [2025-03-17 07:16:01,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:01,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339937412] [2025-03-17 07:16:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:01,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 07:16:01,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 07:16:01,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:01,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 07:16:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339937412] [2025-03-17 07:16:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339937412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151226492] [2025-03-17 07:16:01,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:01,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:01,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:16:01,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 07:16:02,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 07:16:02,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 07:16:02,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:02,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:02,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 07:16:02,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:02,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-17 07:16:02,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-17 07:16:02,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:02,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:02,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-03-17 07:16:02,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:02,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:02,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-17 07:16:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 07:16:02,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151226492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-03-17 07:16:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295921418] [2025-03-17 07:16:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:16:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:02,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:16:02,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:02,819 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 07:16:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:03,328 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2025-03-17 07:16:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-17 07:16:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:03,330 INFO L225 Difference]: With dead ends: 193 [2025-03-17 07:16:03,330 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 07:16:03,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-17 07:16:03,331 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:03,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 354 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:16:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 07:16:03,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-17 07:16:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 96 states have internal predecessors, (116), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-17 07:16:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2025-03-17 07:16:03,356 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 80 [2025-03-17 07:16:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:03,357 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2025-03-17 07:16:03,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 07:16:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2025-03-17 07:16:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 07:16:03,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:03,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:03,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 07:16:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:03,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:03,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2137713651, now seen corresponding path program 1 times [2025-03-17 07:16:03,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:03,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899971150] [2025-03-17 07:16:03,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:03,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 07:16:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 07:16:03,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 07:16:03,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:03,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899971150] [2025-03-17 07:16:03,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899971150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:03,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632306038] [2025-03-17 07:16:03,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:03,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:03,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:03,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:16:03,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 07:16:03,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 07:16:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 07:16:03,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:03,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:03,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 07:16:03,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:03,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-17 07:16:03,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-17 07:16:04,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:04,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:04,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:04,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-03-17 07:16:04,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:04,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:04,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2025-03-17 07:16:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 07:16:04,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:04,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632306038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:04,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:04,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-17 07:16:04,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647657048] [2025-03-17 07:16:04,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:04,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:04,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:04,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:04,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:04,885 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 07:16:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:05,390 INFO L93 Difference]: Finished difference Result 194 states and 252 transitions. [2025-03-17 07:16:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:16:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 80 [2025-03-17 07:16:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:05,394 INFO L225 Difference]: With dead ends: 194 [2025-03-17 07:16:05,394 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 07:16:05,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-17 07:16:05,396 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 59 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:05,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 326 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:16:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 07:16:05,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-17 07:16:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 93 states have internal predecessors, (113), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-17 07:16:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2025-03-17 07:16:05,423 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 80 [2025-03-17 07:16:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:05,423 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2025-03-17 07:16:05,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 07:16:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2025-03-17 07:16:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 07:16:05,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:05,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:05,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 07:16:05,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:05,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:05,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:05,626 INFO L85 PathProgramCache]: Analyzing trace with hash -676133652, now seen corresponding path program 2 times [2025-03-17 07:16:05,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:05,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613541755] [2025-03-17 07:16:05,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 07:16:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:05,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-17 07:16:05,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 80 statements. [2025-03-17 07:16:05,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 07:16:05,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 07:16:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:05,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613541755] [2025-03-17 07:16:05,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613541755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:05,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:05,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:16:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879296665] [2025-03-17 07:16:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:05,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:16:05,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:05,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:16:05,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:16:05,804 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:05,862 INFO L93 Difference]: Finished difference Result 149 states and 198 transitions. [2025-03-17 07:16:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:05,862 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 80 [2025-03-17 07:16:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:05,864 INFO L225 Difference]: With dead ends: 149 [2025-03-17 07:16:05,864 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 07:16:05,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:05,864 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:05,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 07:16:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2025-03-17 07:16:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 95 states have internal predecessors, (115), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-17 07:16:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2025-03-17 07:16:05,878 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 80 [2025-03-17 07:16:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:05,878 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2025-03-17 07:16:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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:05,878 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2025-03-17 07:16:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 07:16:05,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:05,879 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-17 07:16:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 07:16:05,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1980088329, now seen corresponding path program 1 times [2025-03-17 07:16:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864367870] [2025-03-17 07:16:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:05,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 07:16:05,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 07:16:05,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:05,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-17 07:16:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864367870] [2025-03-17 07:16:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864367870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154571360] [2025-03-17 07:16:06,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:06,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:16:06,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 07:16:06,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 07:16:06,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 07:16:06,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:06,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:06,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 07:16:06,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:06,243 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-03-17 07:16:06,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2025-03-17 07:16:06,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 07:16:06,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 07:16:06,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-03-17 07:16:06,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 34 [2025-03-17 07:16:10,365 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|) .cse0))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_2 .cse0) .cse1) (= v_DerPreprocessor_1 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_2) .cse1)))) (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| .cse1))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| .cse2) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| .cse2))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|)))) is different from true [2025-03-17 07:16:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 12 not checked. [2025-03-17 07:16:23,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:23,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 07:16:23,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 310 [2025-03-17 07:16:23,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 146 [2025-03-17 07:16:23,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2025-03-17 07:16:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:16:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154571360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 07:16:31,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 07:16:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 10] total 24 [2025-03-17 07:16:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049437842] [2025-03-17 07:16:31,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 07:16:31,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 07:16:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:31,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 07:16:31,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=4, NotChecked=42, Total=552 [2025-03-17 07:16:31,560 INFO L87 Difference]: Start difference. First operand 131 states and 173 transitions. Second operand has 24 states, 21 states have (on average 4.571428571428571) internal successors, (96), 23 states have internal predecessors, (96), 9 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-17 07:16:34,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:16:38,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:16:42,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:16:46,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:16:50,322 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19|)) (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19| .cse0)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19| v_DerPreprocessor_2) .cse1) v_DerPreprocessor_1) (= .cse1 (select v_DerPreprocessor_2 .cse2)))) (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19| .cse1))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_19|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|) .cse3))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (and (= (select v_DerPreprocessor_2 .cse3) .cse4) (= v_DerPreprocessor_1 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_2) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| .cse4))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|))) (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|) (+ |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))) (and (<= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| .cse5) (not (= |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18| .cse5))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_begin_harness_~#list~0#1.base_BEFORE_CALL_18|))))) is different from true [2025-03-17 07:16:54,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:16:58,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:17:02,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:17:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:03,179 INFO L93 Difference]: Finished difference Result 303 states and 419 transitions. [2025-03-17 07:17:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 07:17:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.571428571428571) internal successors, (96), 23 states have internal predecessors, (96), 9 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) Word has length 74 [2025-03-17 07:17:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:03,181 INFO L225 Difference]: With dead ends: 303 [2025-03-17 07:17:03,181 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 07:17:03,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=186, Invalid=1148, Unknown=6, NotChecked=142, Total=1482 [2025-03-17 07:17:03,185 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 191 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 42 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:03,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 849 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 644 Invalid, 5 Unknown, 221 Unchecked, 26.9s Time] [2025-03-17 07:17:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 07:17:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2025-03-17 07:17:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 101 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 15 states have return successors, (38), 24 states have call predecessors, (38), 24 states have call successors, (38) [2025-03-17 07:17:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2025-03-17 07:17:03,204 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 74 [2025-03-17 07:17:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:03,204 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2025-03-17 07:17:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.571428571428571) internal successors, (96), 23 states have internal predecessors, (96), 9 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (21), 7 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-17 07:17:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2025-03-17 07:17:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:17:03,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:03,205 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:03,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 07:17:03,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:03,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:03,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1695936224, now seen corresponding path program 1 times [2025-03-17 07:17:03,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:03,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300507034] [2025-03-17 07:17:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:03,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:03,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:03,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 07:17:03,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300507034] [2025-03-17 07:17:03,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300507034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:03,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958900736] [2025-03-17 07:17:03,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:03,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:03,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:03,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:17:03,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 07:17:03,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:03,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:03,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:03,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:03,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-03-17 07:17:03,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:03,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-17 07:17:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-17 07:17:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 07:17:04,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:17:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958900736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:17:04,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:17:04,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2025-03-17 07:17:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317625400] [2025-03-17 07:17:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:17:04,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 07:17:04,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:04,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 07:17:04,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-17 07:17:04,301 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 07:17:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:04,965 INFO L93 Difference]: Finished difference Result 216 states and 287 transitions. [2025-03-17 07:17:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 07:17:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 86 [2025-03-17 07:17:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:04,967 INFO L225 Difference]: With dead ends: 216 [2025-03-17 07:17:04,967 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 07:17:04,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-17 07:17:04,968 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:04,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 559 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 07:17:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 07:17:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2025-03-17 07:17:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.25) internal successors, (125), 108 states have internal predecessors, (125), 27 states have call successors, (27), 11 states have call predecessors, (27), 17 states have return successors, (43), 25 states have call predecessors, (43), 25 states have call successors, (43) [2025-03-17 07:17:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 195 transitions. [2025-03-17 07:17:04,989 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 195 transitions. Word has length 86 [2025-03-17 07:17:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:04,989 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 195 transitions. [2025-03-17 07:17:04,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 07:17:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 195 transitions. [2025-03-17 07:17:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:17:04,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:04,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:04,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 07:17:05,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:05,190 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:05,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:05,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1675598849, now seen corresponding path program 1 times [2025-03-17 07:17:05,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:05,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592550068] [2025-03-17 07:17:05,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:05,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:05,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:05,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:05,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:05,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 07:17:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592550068] [2025-03-17 07:17:05,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592550068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543865553] [2025-03-17 07:17:05,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:05,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:05,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:05,496 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:17:05,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 07:17:05,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:05,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:05,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:05,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:05,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 07:17:05,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:05,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 07:17:05,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 07:17:09,846 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_2|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2|) 0))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_2|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_2|) 0)))) is different from true [2025-03-17 07:17:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 07:17:18,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:17:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543865553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:17:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:17:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11] total 24 [2025-03-17 07:17:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789448169] [2025-03-17 07:17:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:17:18,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 07:17:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:18,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 07:17:18,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=441, Unknown=3, NotChecked=42, Total=552 [2025-03-17 07:17:18,030 INFO L87 Difference]: Start difference. First operand 145 states and 195 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 07:17:22,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 07:17:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:22,488 INFO L93 Difference]: Finished difference Result 355 states and 496 transitions. [2025-03-17 07:17:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 07:17:22,488 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 4 states have call successors, (9) Word has length 86 [2025-03-17 07:17:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:22,490 INFO L225 Difference]: With dead ends: 355 [2025-03-17 07:17:22,490 INFO L226 Difference]: Without dead ends: 216 [2025-03-17 07:17:22,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=103, Invalid=654, Unknown=3, NotChecked=52, Total=812 [2025-03-17 07:17:22,491 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:22,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 570 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 390 Invalid, 1 Unknown, 141 Unchecked, 4.3s Time] [2025-03-17 07:17:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-03-17 07:17:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 188. [2025-03-17 07:17:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 139 states have (on average 1.2661870503597121) internal successors, (176), 149 states have internal predecessors, (176), 29 states have call successors, (29), 13 states have call predecessors, (29), 19 states have return successors, (47), 25 states have call predecessors, (47), 27 states have call successors, (47) [2025-03-17 07:17:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 252 transitions. [2025-03-17 07:17:22,511 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 252 transitions. Word has length 86 [2025-03-17 07:17:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:22,511 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 252 transitions. [2025-03-17 07:17:22,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 07:17:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 252 transitions. [2025-03-17 07:17:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:17:22,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:22,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:22,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 07:17:22,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 07:17:22,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:22,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 688749342, now seen corresponding path program 1 times [2025-03-17 07:17:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919168833] [2025-03-17 07:17:22,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:22,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:22,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 07:17:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919168833] [2025-03-17 07:17:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919168833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126685503] [2025-03-17 07:17:22,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:22,876 INFO L229 MonitoredProcess]: Starting monitored process 10 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:17:22,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 07:17:22,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:23,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:23,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:23,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:23,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 07:17:23,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 07:17:23,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:17:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126685503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:17:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:17:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-03-17 07:17:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314949636] [2025-03-17 07:17:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:17:23,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:17:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:23,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:17:23,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-17 07:17:23,125 INFO L87 Difference]: Start difference. First operand 188 states and 252 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 07:17:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:23,277 INFO L93 Difference]: Finished difference Result 420 states and 579 transitions. [2025-03-17 07:17:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 07:17:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2025-03-17 07:17:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:23,280 INFO L225 Difference]: With dead ends: 420 [2025-03-17 07:17:23,280 INFO L226 Difference]: Without dead ends: 244 [2025-03-17 07:17:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-17 07:17:23,281 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:23,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 496 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:17:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-17 07:17:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 221. [2025-03-17 07:17:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 180 states have internal predecessors, (208), 32 states have call successors, (32), 13 states have call predecessors, (32), 25 states have return successors, (68), 27 states have call predecessors, (68), 30 states have call successors, (68) [2025-03-17 07:17:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 308 transitions. [2025-03-17 07:17:23,308 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 308 transitions. Word has length 86 [2025-03-17 07:17:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:23,309 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 308 transitions. [2025-03-17 07:17:23,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 07:17:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 308 transitions. [2025-03-17 07:17:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:17:23,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:23,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:23,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 07:17:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:23,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1921911936, now seen corresponding path program 1 times [2025-03-17 07:17:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104496378] [2025-03-17 07:17:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:23,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:23,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:23,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:23,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 07:17:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104496378] [2025-03-17 07:17:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104496378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440334946] [2025-03-17 07:17:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:23,564 INFO L229 MonitoredProcess]: Starting monitored process 11 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:17:23,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 07:17:23,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:23,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:23,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:23,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:23,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 07:17:23,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 07:17:23,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:17:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440334946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:17:23,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:17:23,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-17 07:17:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777415024] [2025-03-17 07:17:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:17:23,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:17:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:23,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:17:23,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:17:23,716 INFO L87 Difference]: Start difference. First operand 221 states and 308 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:17:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:23,760 INFO L93 Difference]: Finished difference Result 436 states and 632 transitions. [2025-03-17 07:17:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:17:23,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-17 07:17:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:23,762 INFO L225 Difference]: With dead ends: 436 [2025-03-17 07:17:23,762 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 07:17:23,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:17:23,764 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:23,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:17:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 07:17:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2025-03-17 07:17:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 167 states have (on average 1.2694610778443114) internal successors, (212), 184 states have internal predecessors, (212), 32 states have call successors, (32), 13 states have call predecessors, (32), 25 states have return successors, (68), 27 states have call predecessors, (68), 30 states have call successors, (68) [2025-03-17 07:17:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 312 transitions. [2025-03-17 07:17:23,789 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 312 transitions. Word has length 86 [2025-03-17 07:17:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 312 transitions. [2025-03-17 07:17:23,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:17:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 312 transitions. [2025-03-17 07:17:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:17:23,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:23,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:23,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 07:17:23,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 07:17:23,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1764978497, now seen corresponding path program 1 times [2025-03-17 07:17:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041128783] [2025-03-17 07:17:23,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:24,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:24,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:24,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:24,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 07:17:24,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041128783] [2025-03-17 07:17:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041128783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267766451] [2025-03-17 07:17:24,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:24,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:24,043 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17:24,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 07:17:24,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:24,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:24,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:24,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:24,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 07:17:24,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 07:17:24,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:17:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267766451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:17:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:17:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-17 07:17:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087325083] [2025-03-17 07:17:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:17:24,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:17:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:24,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:17:24,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:17:24,196 INFO L87 Difference]: Start difference. First operand 225 states and 312 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:17:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:24,222 INFO L93 Difference]: Finished difference Result 444 states and 642 transitions. [2025-03-17 07:17:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:17:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-17 07:17:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:24,225 INFO L225 Difference]: With dead ends: 444 [2025-03-17 07:17:24,225 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 07:17:24,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:17:24,226 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:24,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:17:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 07:17:24,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 225. [2025-03-17 07:17:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 167 states have (on average 1.2455089820359282) internal successors, (208), 184 states have internal predecessors, (208), 32 states have call successors, (32), 13 states have call predecessors, (32), 25 states have return successors, (68), 27 states have call predecessors, (68), 30 states have call successors, (68) [2025-03-17 07:17:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 308 transitions. [2025-03-17 07:17:24,252 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 308 transitions. Word has length 86 [2025-03-17 07:17:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:24,252 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 308 transitions. [2025-03-17 07:17:24,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:17:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 308 transitions. [2025-03-17 07:17:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:17:24,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:24,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:24,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 07:17:24,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 07:17:24,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:24,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2135693120, now seen corresponding path program 1 times [2025-03-17 07:17:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:24,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355733653] [2025-03-17 07:17:24,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:24,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:24,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:24,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:24,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:24,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 07:17:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355733653] [2025-03-17 07:17:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355733653] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221387811] [2025-03-17 07:17:24,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:24,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:24,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:24,510 INFO L229 MonitoredProcess]: Starting monitored process 13 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:17:24,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 07:17:24,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:17:24,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:17:24,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:24,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:24,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 07:17:24,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 07:17:24,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:17:24,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221387811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:17:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:17:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-17 07:17:24,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103941339] [2025-03-17 07:17:24,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:17:24,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:17:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:24,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:17:24,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:17:24,674 INFO L87 Difference]: Start difference. First operand 225 states and 308 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:17:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:17:24,717 INFO L93 Difference]: Finished difference Result 420 states and 599 transitions. [2025-03-17 07:17:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:17:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-17 07:17:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:17:24,718 INFO L225 Difference]: With dead ends: 420 [2025-03-17 07:17:24,718 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 07:17:24,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:17:24,721 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:17:24,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:17:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 07:17:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2025-03-17 07:17:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 149 states have (on average 1.2348993288590604) internal successors, (184), 163 states have internal predecessors, (184), 30 states have call successors, (30), 13 states have call predecessors, (30), 24 states have return successors, (60), 27 states have call predecessors, (60), 28 states have call successors, (60) [2025-03-17 07:17:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 274 transitions. [2025-03-17 07:17:24,743 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 274 transitions. Word has length 86 [2025-03-17 07:17:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:17:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 274 transitions. [2025-03-17 07:17:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-17 07:17:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 274 transitions. [2025-03-17 07:17:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 07:17:24,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:17:24,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:17:24,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 07:17:24,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 07:17:24,946 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:17:24,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:17:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 460137627, now seen corresponding path program 1 times [2025-03-17 07:17:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:17:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371239658] [2025-03-17 07:17:24,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:17:24,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 07:17:24,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 07:17:24,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:24,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 07:17:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:17:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371239658] [2025-03-17 07:17:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371239658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:17:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122256834] [2025-03-17 07:17:25,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:17:25,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:17:25,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:17:25,162 INFO L229 MonitoredProcess]: Starting monitored process 14 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:17:25,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 07:17:25,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 07:17:25,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 07:17:25,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:17:25,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:17:25,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 07:17:25,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:17:25,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-17 07:17:25,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-17 07:17:25,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 07:17:25,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-17 07:17:25,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-17 07:17:25,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 07:17:25,498 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-17 07:17:25,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 127 [2025-03-17 07:17:25,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2025-03-17 07:17:25,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:17:25,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2025-03-17 07:17:25,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13