./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_array_list_copy_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 222962222638f0fcfd5888fac8242f8ce08239110602155fe31bfd0578d28673 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:33:03,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:33:03,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:33:03,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:33:03,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:33:04,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:33:04,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:33:04,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:33:04,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:33:04,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:33:04,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:33:04,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:33:04,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:33:04,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:33:04,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:33:04,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:33:04,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:33:04,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:33:04,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:33:04,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:33:04,019 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 -> 222962222638f0fcfd5888fac8242f8ce08239110602155fe31bfd0578d28673 [2025-03-04 02:33:04,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:33:04,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:33:04,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:33:04,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:33:04,247 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:33:04,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i [2025-03-04 02:33:05,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ae19485/cd952eeb2aa54cdfb9df5c03c11a9537/FLAGa8983435d [2025-03-04 02:33:05,926 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:33:05,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_copy_harness_negated.i [2025-03-04 02:33:05,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ae19485/cd952eeb2aa54cdfb9df5c03c11a9537/FLAGa8983435d [2025-03-04 02:33:06,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ae19485/cd952eeb2aa54cdfb9df5c03c11a9537 [2025-03-04 02:33:06,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:33:06,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:33:06,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:33:06,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:33:06,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:33:06,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:33:06" (1/1) ... [2025-03-04 02:33:06,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a6b06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:06, skipping insertion in model container [2025-03-04 02:33:06,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:33:06" (1/1) ... [2025-03-04 02:33:06,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:33:06,265 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_array_list_copy_harness_negated.i[4493,4506] [2025-03-04 02:33:06,272 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_array_list_copy_harness_negated.i[4553,4566] [2025-03-04 02:33:06,728 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,729 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,730 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,731 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,747 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,747 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,748 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,750 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:06,752 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,039 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,040 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,057 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:33:07,141 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:33:07,151 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_array_list_copy_harness_negated.i[4493,4506] [2025-03-04 02:33:07,151 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_array_list_copy_harness_negated.i[4553,4566] [2025-03-04 02:33:07,201 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,202 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,202 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,202 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,203 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,209 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,210 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,212 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,213 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,213 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,283 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,284 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,285 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,289 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:33:07,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7743-7754] [2025-03-04 02:33:07,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:33:07,501 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:33:07,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07 WrapperNode [2025-03-04 02:33:07,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:33:07,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:33:07,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:33:07,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:33:07,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,630 INFO L138 Inliner]: procedures = 680, calls = 1678, calls flagged for inlining = 52, calls inlined = 7, statements flattened = 718 [2025-03-04 02:33:07,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:33:07,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:33:07,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:33:07,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:33:07,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,708 INFO L175 MemorySlicer]: Split 313 memory accesses to 5 slices as follows [238, 2, 9, 7, 57]. 76 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 1, 5, 10]. The 241 writes are split as follows [232, 0, 1, 1, 7]. [2025-03-04 02:33:07,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,738 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:33:07,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:33:07,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:33:07,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:33:07,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (1/1) ... [2025-03-04 02:33:07,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:33:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:33:07,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:33:07,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:33:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:33:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-03-04 02:33:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-03-04 02:33:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-03-04 02:33:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-03-04 02:33:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:33:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:33:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-04 02:33:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:33:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:33:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:33:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:33:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2025-03-04 02:33:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:33:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:33:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-03-04 02:33:07,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:33:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:33:08,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:33:08,046 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:33:08,082 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-03-04 02:33:08,131 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-03-04 02:33:08,156 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc nondet_uint8_t_#t~nondet10#1; [2025-03-04 02:33:08,163 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc #t~ret81;havoc #t~ite83.base, #t~ite83.offset;havoc #t~ret82.base, #t~ret82.offset; [2025-03-04 02:33:08,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-03-04 02:33:08,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:33:08,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821: havoc #t~ret89.base, #t~ret89.offset; [2025-03-04 02:33:08,250 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7364: havoc #t~ret682.base, #t~ret682.offset; [2025-03-04 02:33:13,399 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7481: havoc aws_array_list_copy_#t~ret750#1;call ULTIMATE.dealloc(aws_array_list_copy_~#copy_size~0#1.base, aws_array_list_copy_~#copy_size~0#1.offset);havoc aws_array_list_copy_~#copy_size~0#1.base, aws_array_list_copy_~#copy_size~0#1.offset; [2025-03-04 02:33:13,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7459: havoc aws_array_list_copy_~tmp~2#1.base, aws_array_list_copy_~tmp~2#1.offset; [2025-03-04 02:33:13,479 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-04 02:33:13,479 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:33:13,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:33:13,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:33:13,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:33:13 BoogieIcfgContainer [2025-03-04 02:33:13,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:33:13,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:33:13,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:33:13,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:33:13,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:33:06" (1/3) ... [2025-03-04 02:33:13,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69935bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:33:13, skipping insertion in model container [2025-03-04 02:33:13,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:33:07" (2/3) ... [2025-03-04 02:33:13,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69935bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:33:13, skipping insertion in model container [2025-03-04 02:33:13,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:33:13" (3/3) ... [2025-03-04 02:33:13,502 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_copy_harness_negated.i [2025-03-04 02:33:13,515 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:33:13,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_copy_harness_negated.i that has 18 procedures, 209 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:33:13,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:33:13,568 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;@51c408b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:33:13,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:33:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-04 02:33:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 02:33:13,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:33:13,587 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:33:13,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:33:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:33:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2126687303, now seen corresponding path program 1 times [2025-03-04 02:33:13,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:33:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977646274] [2025-03-04 02:33:13,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:33:17,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 02:33:18,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 02:33:18,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:18,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 02:33:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:33:18,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977646274] [2025-03-04 02:33:18,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977646274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:33:18,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422631651] [2025-03-04 02:33:18,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:18,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:33:18,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:33:18,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:33:18,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:33:22,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 02:33:23,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 02:33:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:23,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:33:23,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:33:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-04 02:33:23,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:33:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422631651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:33:23,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:33:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:33:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223996791] [2025-03-04 02:33:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:33:23,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:33:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:33:23,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:33:23,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:33:23,459 INFO L87 Difference]: Start difference. First operand has 209 states, 119 states have (on average 1.184873949579832) internal successors, (141), 120 states have internal predecessors, (141), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 02:33:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:33:23,494 INFO L93 Difference]: Finished difference Result 414 states and 603 transitions. [2025-03-04 02:33:23,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:33:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2025-03-04 02:33:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:33:23,501 INFO L225 Difference]: With dead ends: 414 [2025-03-04 02:33:23,501 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 02:33:23,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:33:23,506 INFO L435 NwaCegarLoop]: 281 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, 281 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:33:23,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:33:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 02:33:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 02:33:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.173913043478261) internal successors, (135), 116 states have internal predecessors, (135), 71 states have call successors, (71), 17 states have call predecessors, (71), 17 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 02:33:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2025-03-04 02:33:23,554 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 145 [2025-03-04 02:33:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:33:23,555 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2025-03-04 02:33:23,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 02:33:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2025-03-04 02:33:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 02:33:23,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:33:23,561 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:33:23,575 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-04 02:33:23,762 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-04 02:33:23,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:33:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:33:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 468794211, now seen corresponding path program 1 times [2025-03-04 02:33:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:33:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339105410] [2025-03-04 02:33:23,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:33:27,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 02:33:27,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 02:33:27,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:27,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-03-04 02:33:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:33:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339105410] [2025-03-04 02:33:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339105410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:33:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447055600] [2025-03-04 02:33:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:28,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:33:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:33:28,834 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-04 02:33:28,835 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-04 02:33:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 02:33:33,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 02:33:33,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:33,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:33,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 4369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:33:33,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:33:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 02:33:34,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:33:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447055600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:33:34,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:33:34,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 02:33:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119269732] [2025-03-04 02:33:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:33:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:33:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:33:34,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:33:34,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:33:34,130 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-04 02:33:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:33:36,923 INFO L93 Difference]: Finished difference Result 403 states and 556 transitions. [2025-03-04 02:33:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:33:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 145 [2025-03-04 02:33:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:33:36,927 INFO L225 Difference]: With dead ends: 403 [2025-03-04 02:33:36,927 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:33:36,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:33:36,928 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 282 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 02:33:36,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 779 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 02:33:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:33:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 02:33:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 118 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (82), 70 states have call predecessors, (82), 70 states have call successors, (82) [2025-03-04 02:33:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 289 transitions. [2025-03-04 02:33:36,948 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 289 transitions. Word has length 145 [2025-03-04 02:33:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:33:36,949 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 289 transitions. [2025-03-04 02:33:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-04 02:33:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 289 transitions. [2025-03-04 02:33:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-04 02:33:36,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:33:36,951 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:33:36,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:33:37,151 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,SelfDestructingSolverStorable1 [2025-03-04 02:33:37,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:33:37,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:33:37,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1404661059, now seen corresponding path program 1 times [2025-03-04 02:33:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:33:37,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355137924] [2025-03-04 02:33:37,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:33:41,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 02:33:41,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 02:33:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:41,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-03-04 02:33:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:33:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355137924] [2025-03-04 02:33:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355137924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:33:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816184912] [2025-03-04 02:33:42,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:42,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:33:42,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:33:42,078 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-04 02:33:42,081 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-04 02:33:46,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 02:33:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 02:33:46,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:46,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:46,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 4496 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 02:33:46,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:33:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 02:33:47,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:33:47,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816184912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:33:47,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:33:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 02:33:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040724772] [2025-03-04 02:33:47,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:33:47,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:33:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:33:47,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:33:47,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:33:47,431 INFO L87 Difference]: Start difference. First operand 206 states and 289 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-04 02:33:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:33:50,325 INFO L93 Difference]: Finished difference Result 379 states and 529 transitions. [2025-03-04 02:33:50,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:33:50,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 160 [2025-03-04 02:33:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:33:50,328 INFO L225 Difference]: With dead ends: 379 [2025-03-04 02:33:50,328 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:33:50,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:33:50,329 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 280 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 02:33:50,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 782 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 02:33:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:33:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 02:33:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 118 states have internal predecessors, (136), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (80), 70 states have call predecessors, (80), 70 states have call successors, (80) [2025-03-04 02:33:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2025-03-04 02:33:50,347 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 160 [2025-03-04 02:33:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:33:50,348 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2025-03-04 02:33:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-04 02:33:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2025-03-04 02:33:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 02:33:50,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:33:50,350 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:33:50,366 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-04 02:33:50,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:33:50,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:33:50,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:33:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1219636359, now seen corresponding path program 2 times [2025-03-04 02:33:50,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:33:50,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169751714] [2025-03-04 02:33:50,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:33:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:33:54,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 175 statements into 2 equivalence classes. [2025-03-04 02:33:54,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 175 statements. [2025-03-04 02:33:54,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:33:54,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:33:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-04 02:33:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:33:55,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169751714] [2025-03-04 02:33:55,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169751714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:33:55,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:33:55,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:33:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158244399] [2025-03-04 02:33:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:33:55,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:33:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:33:55,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:33:55,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:33:55,188 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 02:33:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:33:55,392 INFO L93 Difference]: Finished difference Result 265 states and 363 transitions. [2025-03-04 02:33:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:33:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 175 [2025-03-04 02:33:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:33:55,397 INFO L225 Difference]: With dead ends: 265 [2025-03-04 02:33:55,397 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 02:33:55,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:33:55,398 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:33:55,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:33:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 02:33:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 02:33:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 122 states have internal predecessors, (140), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (82), 71 states have call predecessors, (82), 70 states have call successors, (82) [2025-03-04 02:33:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 293 transitions. [2025-03-04 02:33:55,420 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 293 transitions. Word has length 175 [2025-03-04 02:33:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:33:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 293 transitions. [2025-03-04 02:33:55,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-04 02:33:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 293 transitions. [2025-03-04 02:33:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 02:33:55,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:33:55,424 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:33:55,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:33:55,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:33:55,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:33:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1564517301, now seen corresponding path program 1 times [2025-03-04 02:33:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:33:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823180487] [2025-03-04 02:33:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:33:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:33:59,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 02:33:59,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 02:33:59,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:33:59,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:00,701 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-04 02:34:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823180487] [2025-03-04 02:34:00,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823180487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:34:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389787470] [2025-03-04 02:34:00,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:00,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:34:00,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:34:00,705 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-04 02:34:00,706 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-04 02:34:05,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 02:34:05,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 02:34:05,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:05,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:05,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 4627 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 02:34:05,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:34:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-04 02:34:06,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:34:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389787470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:06,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:34:06,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-04 02:34:06,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530041189] [2025-03-04 02:34:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:06,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:34:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:06,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:34:06,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:34:06,758 INFO L87 Difference]: Start difference. First operand 211 states and 293 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-04 02:34:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:10,187 INFO L93 Difference]: Finished difference Result 378 states and 520 transitions. [2025-03-04 02:34:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:34:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 181 [2025-03-04 02:34:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:10,189 INFO L225 Difference]: With dead ends: 378 [2025-03-04 02:34:10,189 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 02:34:10,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:34:10,191 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 308 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 02:34:10,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 945 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 02:34:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 02:34:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 02:34:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 122 states have internal predecessors, (140), 71 states have call successors, (71), 17 states have call predecessors, (71), 19 states have return successors, (77), 71 states have call predecessors, (77), 70 states have call successors, (77) [2025-03-04 02:34:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2025-03-04 02:34:10,202 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 181 [2025-03-04 02:34:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:10,202 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2025-03-04 02:34:10,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-04 02:34:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2025-03-04 02:34:10,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 02:34:10,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:10,204 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:34:10,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 02:34:10,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:34:10,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:10,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash -687223814, now seen corresponding path program 1 times [2025-03-04 02:34:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:10,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860685017] [2025-03-04 02:34:10,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:14,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 02:34:14,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 02:34:14,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:14,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-04 02:34:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860685017] [2025-03-04 02:34:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860685017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:34:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:34:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687039603] [2025-03-04 02:34:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:15,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:34:15,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:15,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:34:15,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:34:15,215 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 02:34:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:34:16,333 INFO L93 Difference]: Finished difference Result 375 states and 505 transitions. [2025-03-04 02:34:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:34:16,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 195 [2025-03-04 02:34:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:34:16,335 INFO L225 Difference]: With dead ends: 375 [2025-03-04 02:34:16,335 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 02:34:16,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:34:16,337 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 79 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:34:16,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1111 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 02:34:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 02:34:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-04 02:34:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 120 states have internal predecessors, (138), 71 states have call successors, (71), 17 states have call predecessors, (71), 18 states have return successors, (72), 71 states have call predecessors, (72), 70 states have call successors, (72) [2025-03-04 02:34:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 281 transitions. [2025-03-04 02:34:16,350 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 281 transitions. Word has length 195 [2025-03-04 02:34:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:34:16,351 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 281 transitions. [2025-03-04 02:34:16,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 02:34:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 281 transitions. [2025-03-04 02:34:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-04 02:34:16,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:34:16,353 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:34:16,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:34:16,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:34:16,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:34:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash 2126494464, now seen corresponding path program 1 times [2025-03-04 02:34:16,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:34:16,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372169501] [2025-03-04 02:34:16,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:34:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:34:20,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-04 02:34:20,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 02:34:20,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:34:20,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:34:23,312 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-04 02:34:23,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:34:23,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372169501] [2025-03-04 02:34:23,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372169501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:34:23,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:34:23,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:34:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396871406] [2025-03-04 02:34:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:34:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:34:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:34:23,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:34:23,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:34:23,313 INFO L87 Difference]: Start difference. First operand 209 states and 281 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 6 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 7 states have call predecessors, (26), 6 states have call successors, (26) [2025-03-04 02:34:27,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 02:34:31,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []