./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.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_hash_table_clean_up_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a0dd09971efa7db826882d7e7ad0499c235114631ef797adfcc295e8a3fc3e13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:54:04,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:54:04,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:54:04,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:54:04,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:54:04,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:54:04,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:54:04,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:54:04,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:54:04,366 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:54:04,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:54:04,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:54:04,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:54:04,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:54:04,367 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:54:04,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:54:04,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:54:04,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:54:04,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:54:04,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:54:04,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:54:04,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:04,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:54:04,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:54:04,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:54:04,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:54:04,370 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 -> a0dd09971efa7db826882d7e7ad0499c235114631ef797adfcc295e8a3fc3e13 [2025-03-04 02:54:04,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:54:04,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:54:04,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:54:04,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:54:04,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:54:04,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2025-03-04 02:54:05,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92f516b1/01dbd1124148424dab82a36bf59d5bd3/FLAG6a8a5a686 [2025-03-04 02:54:06,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:54:06,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_clean_up_harness.i [2025-03-04 02:54:06,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92f516b1/01dbd1124148424dab82a36bf59d5bd3/FLAG6a8a5a686 [2025-03-04 02:54:06,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92f516b1/01dbd1124148424dab82a36bf59d5bd3 [2025-03-04 02:54:06,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:54:06,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:54:06,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:06,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:54:06,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:54:06,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:06" (1/1) ... [2025-03-04 02:54:06,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb3020f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:06, skipping insertion in model container [2025-03-04 02:54:06,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:54:06" (1/1) ... [2025-03-04 02:54:06,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:54:06,651 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_hash_table_clean_up_harness.i[4497,4510] [2025-03-04 02:54:06,659 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_hash_table_clean_up_harness.i[4557,4570] [2025-03-04 02:54:07,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,328 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:07,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,108 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,109 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,137 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,138 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,146 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,147 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,161 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,162 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,162 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,162 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,163 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,163 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,163 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,199 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_hash_table_clean_up_harness.i[228346,228359] [2025-03-04 02:54:08,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:08,230 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:54:08,243 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_hash_table_clean_up_harness.i[4497,4510] [2025-03-04 02:54:08,244 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_hash_table_clean_up_harness.i[4557,4570] [2025-03-04 02:54:08,286 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,287 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,288 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,293 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,294 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,295 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,295 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,296 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,296 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,296 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,297 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,368 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7585-7596] [2025-03-04 02:54:08,439 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,440 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,502 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,503 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,513 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,514 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,514 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,514 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,515 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,516 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:54:08,534 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_hash_table_clean_up_harness.i[228346,228359] [2025-03-04 02:54:08,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:54:08,696 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:54:08,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08 WrapperNode [2025-03-04 02:54:08,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:54:08,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:08,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:54:08,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:54:08,702 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:54:08" (1/1) ... [2025-03-04 02:54:08,769 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:54:08" (1/1) ... [2025-03-04 02:54:08,824 INFO L138 Inliner]: procedures = 764, calls = 2440, calls flagged for inlining = 72, calls inlined = 16, statements flattened = 716 [2025-03-04 02:54:08,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:54:08,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:54:08,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:54:08,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:54:08,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,910 INFO L175 MemorySlicer]: Split 304 memory accesses to 8 slices as follows [238, 2, 1, 16, 2, 37, 2, 6]. 78 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [6, 2, 0, 0, 0, 0, 0, 5]. The 243 writes are split as follows [232, 0, 1, 2, 1, 6, 1, 0]. [2025-03-04 02:54:08,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:54:08,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:54:08,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:54:08,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:54:08,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (1/1) ... [2025-03-04 02:54:08,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:54:08,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:54:09,000 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:54:09,003 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:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure memset_override_0_impl [2025-03-04 02:54:09,020 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_override_0_impl [2025-03-04 02:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:54:09,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:54:09,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:54:09,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:54:09,022 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:54:09,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:54:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:54:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:54:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:54:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-04 02:54:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-04 02:54:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:54:09,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:54:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:54:09,025 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:54:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:54:09,025 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:54:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:54:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2025-03-04 02:54:09,026 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:54:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:54:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:54:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:54:09,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:54:09,337 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:54:09,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6947: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:54:09,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10130: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:54:09,484 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:54:09,486 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:54:09,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7415: havoc #t~ret691.base, #t~ret691.offset; [2025-03-04 02:54:09,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10017: havoc #t~mem1492.base, #t~mem1492.offset;havoc #t~short1493;havoc #t~mem1494.base, #t~mem1494.offset;havoc #t~ret1495;havoc #t~short1496; [2025-03-04 02:54:09,519 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:54:09,586 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:54:09,597 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:54:14,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6833: havoc aws_hash_table_has_an_empty_slot_#t~mem566#1.base, aws_hash_table_has_an_empty_slot_#t~mem566#1.offset;havoc aws_hash_table_has_an_empty_slot_#t~ret567#1; [2025-03-04 02:54:14,778 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6843: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:54:14,851 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-03-04 02:54:14,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:54:14,870 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:54:14,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:54:14,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:14 BoogieIcfgContainer [2025-03-04 02:54:14,872 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:54:14,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:54:14,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:54:14,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:54:14,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:54:06" (1/3) ... [2025-03-04 02:54:14,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68214959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:14, skipping insertion in model container [2025-03-04 02:54:14,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:54:08" (2/3) ... [2025-03-04 02:54:14,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68214959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:54:14, skipping insertion in model container [2025-03-04 02:54:14,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:54:14" (3/3) ... [2025-03-04 02:54:14,879 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_clean_up_harness.i [2025-03-04 02:54:14,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:54:14,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_clean_up_harness.i that has 20 procedures, 198 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:54:14,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:54:14,948 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;@25040842, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:54:14,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:54:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 131 states have internal predecessors, (155), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 02:54:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:54:14,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:14,963 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 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:54:14,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 440707454, now seen corresponding path program 1 times [2025-03-04 02:54:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81507702] [2025-03-04 02:54:14,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:19,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:54:19,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:54:19,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:19,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 02:54:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81507702] [2025-03-04 02:54:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81507702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:54:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530132191] [2025-03-04 02:54:20,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:20,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:54:20,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:54:20,270 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:54:20,272 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:54:24,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:54:25,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:54:25,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:25,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:25,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 4328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:54:25,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:54:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-03-04 02:54:25,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:54:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530132191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:25,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:54:25,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:54:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627351209] [2025-03-04 02:54:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:25,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:54:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:25,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:54:25,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:54:25,416 INFO L87 Difference]: Start difference. First operand has 198 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 131 states have internal predecessors, (155), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:25,460 INFO L93 Difference]: Finished difference Result 391 states and 523 transitions. [2025-03-04 02:54:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:54:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:54:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:25,468 INFO L225 Difference]: With dead ends: 391 [2025-03-04 02:54:25,468 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 02:54:25,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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:54:25,472 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:25,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:54:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 02:54:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-04 02:54:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.1612903225806452) internal successors, (144), 125 states have internal predecessors, (144), 47 states have call successors, (47), 19 states have call predecessors, (47), 19 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 02:54:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 237 transitions. [2025-03-04 02:54:25,522 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 237 transitions. Word has length 134 [2025-03-04 02:54:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:25,523 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 237 transitions. [2025-03-04 02:54:25,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 237 transitions. [2025-03-04 02:54:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 02:54:25,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:25,527 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 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:54:25,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:54:25,728 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:54:25,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:25,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:25,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1481133982, now seen corresponding path program 1 times [2025-03-04 02:54:25,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:25,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513974571] [2025-03-04 02:54:25,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:29,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 02:54:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 02:54:29,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:29,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513974571] [2025-03-04 02:54:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513974571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:30,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:30,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:30,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284169519] [2025-03-04 02:54:30,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:30,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:30,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:30,942 INFO L87 Difference]: Start difference. First operand 191 states and 237 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:31,171 INFO L93 Difference]: Finished difference Result 345 states and 429 transitions. [2025-03-04 02:54:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 134 [2025-03-04 02:54:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:31,174 INFO L225 Difference]: With dead ends: 345 [2025-03-04 02:54:31,174 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 02:54:31,175 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:54:31,175 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:31,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 928 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:54:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 02:54:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 02:54:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 128 states have (on average 1.15625) internal successors, (148), 129 states have internal predecessors, (148), 47 states have call successors, (47), 19 states have call predecessors, (47), 20 states have return successors, (47), 47 states have call predecessors, (47), 46 states have call successors, (47) [2025-03-04 02:54:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2025-03-04 02:54:31,191 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 134 [2025-03-04 02:54:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:31,191 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2025-03-04 02:54:31,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 02:54:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2025-03-04 02:54:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:54:31,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:31,196 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:31,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:54:31,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -559455556, now seen corresponding path program 1 times [2025-03-04 02:54:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351122566] [2025-03-04 02:54:31,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:35,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:54:35,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:54:35,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:35,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351122566] [2025-03-04 02:54:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351122566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:54:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865448095] [2025-03-04 02:54:38,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:54:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:38,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:54:38,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:54:38,788 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:54:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:42,334 INFO L93 Difference]: Finished difference Result 340 states and 427 transitions. [2025-03-04 02:54:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:54:42,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 140 [2025-03-04 02:54:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:42,337 INFO L225 Difference]: With dead ends: 340 [2025-03-04 02:54:42,337 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 02:54:42,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:54:42,344 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 53 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:42,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1496 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 02:54:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 02:54:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2025-03-04 02:54:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 132 states have (on average 1.1590909090909092) internal successors, (153), 134 states have internal predecessors, (153), 47 states have call successors, (47), 19 states have call predecessors, (47), 21 states have return successors, (50), 47 states have call predecessors, (50), 46 states have call successors, (50) [2025-03-04 02:54:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2025-03-04 02:54:42,360 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 140 [2025-03-04 02:54:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:42,361 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2025-03-04 02:54:42,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 states have internal predecessors, (64), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 02:54:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2025-03-04 02:54:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 02:54:42,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:42,362 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:42,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:54:42,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1514976835, now seen corresponding path program 1 times [2025-03-04 02:54:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:42,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916666860] [2025-03-04 02:54:42,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:46,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 02:54:46,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 02:54:46,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:46,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:47,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916666860] [2025-03-04 02:54:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916666860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:47,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:47,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:54:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903339822] [2025-03-04 02:54:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:47,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:54:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:47,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:54:47,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:47,314 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:54:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:47,813 INFO L93 Difference]: Finished difference Result 346 states and 436 transitions. [2025-03-04 02:54:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:54:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 140 [2025-03-04 02:54:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:47,816 INFO L225 Difference]: With dead ends: 346 [2025-03-04 02:54:47,816 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 02:54:47,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:54:47,817 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 52 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:47,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 836 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 02:54:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 02:54:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2025-03-04 02:54:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 135 states have internal predecessors, (154), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:54:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2025-03-04 02:54:47,830 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 140 [2025-03-04 02:54:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:47,830 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2025-03-04 02:54:47,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 02:54:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2025-03-04 02:54:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 02:54:47,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:47,832 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:47,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:54:47,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:47,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -393574502, now seen corresponding path program 1 times [2025-03-04 02:54:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400657711] [2025-03-04 02:54:47,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:51,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 02:54:51,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 02:54:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:54:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 02:54:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:54:53,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400657711] [2025-03-04 02:54:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400657711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:54:53,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:54:53,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:54:53,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182325111] [2025-03-04 02:54:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:54:53,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:54:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:54:53,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:54:53,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:54:53,888 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 02:54:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:54:54,702 INFO L93 Difference]: Finished difference Result 348 states and 444 transitions. [2025-03-04 02:54:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:54:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 146 [2025-03-04 02:54:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:54:54,706 INFO L225 Difference]: With dead ends: 348 [2025-03-04 02:54:54,706 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 02:54:54,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:54:54,708 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 3 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 02:54:54,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1339 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 02:54:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 02:54:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2025-03-04 02:54:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.150375939849624) internal successors, (153), 135 states have internal predecessors, (153), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:54:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2025-03-04 02:54:54,721 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 146 [2025-03-04 02:54:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:54:54,722 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2025-03-04 02:54:54,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-04 02:54:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2025-03-04 02:54:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 02:54:54,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:54:54,723 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:54:54,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:54:54,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:54:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1893965315, now seen corresponding path program 1 times [2025-03-04 02:54:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:54:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016363628] [2025-03-04 02:54:54,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:54:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:54:58,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 02:54:58,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 02:54:58,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:54:58,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-04 02:55:00,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:00,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016363628] [2025-03-04 02:55:00,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016363628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:00,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:00,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:55:00,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742338923] [2025-03-04 02:55:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:00,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:55:00,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:00,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:55:00,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:55:00,673 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 02:55:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:02,821 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2025-03-04 02:55:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:55:02,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 153 [2025-03-04 02:55:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:02,826 INFO L225 Difference]: With dead ends: 225 [2025-03-04 02:55:02,827 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 02:55:02,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:55:02,828 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 59 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:02,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1329 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 02:55:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 02:55:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-04 02:55:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.1428571428571428) internal successors, (152), 135 states have internal predecessors, (152), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:55:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-03-04 02:55:02,842 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 153 [2025-03-04 02:55:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:02,843 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-03-04 02:55:02,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-04 02:55:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-03-04 02:55:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 02:55:02,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:02,846 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:02,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:55:02,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -589131572, now seen corresponding path program 1 times [2025-03-04 02:55:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:02,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515449570] [2025-03-04 02:55:02,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:06,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 02:55:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 02:55:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-04 02:55:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:07,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515449570] [2025-03-04 02:55:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515449570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:55:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:55:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991257384] [2025-03-04 02:55:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:07,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:55:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:07,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:55:07,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:55:07,878 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-04 02:55:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:08,280 INFO L93 Difference]: Finished difference Result 314 states and 388 transitions. [2025-03-04 02:55:08,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:55:08,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 178 [2025-03-04 02:55:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:08,283 INFO L225 Difference]: With dead ends: 314 [2025-03-04 02:55:08,283 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 02:55:08,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:55:08,284 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:08,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:55:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 02:55:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-04 02:55:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 135 states have internal predecessors, (151), 48 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-04 02:55:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2025-03-04 02:55:08,293 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 178 [2025-03-04 02:55:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:08,294 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2025-03-04 02:55:08,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-04 02:55:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2025-03-04 02:55:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 02:55:08,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:08,296 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:08,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:55:08,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:08,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1802796208, now seen corresponding path program 1 times [2025-03-04 02:55:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126942438] [2025-03-04 02:55:08,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:08,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:55:12,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 02:55:12,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 02:55:12,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-03-04 02:55:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:55:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126942438] [2025-03-04 02:55:15,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126942438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:55:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090234772] [2025-03-04 02:55:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:55:15,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:55:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:55:15,588 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:55:15,589 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:55:20,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 02:55:20,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 02:55:20,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:55:20,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:55:20,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 4522 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 02:55:20,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:55:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 02:55:24,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:55:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090234772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:55:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:55:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-03-04 02:55:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940810970] [2025-03-04 02:55:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:55:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:55:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:55:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:55:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2025-03-04 02:55:24,446 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand has 11 states, 9 states have (on average 10.0) internal successors, (90), 10 states have internal predecessors, (90), 5 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 4 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-04 02:55:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:55:30,526 INFO L93 Difference]: Finished difference Result 320 states and 395 transitions. [2025-03-04 02:55:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:55:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 10.0) internal successors, (90), 10 states have internal predecessors, (90), 5 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 4 states have call predecessors, (28), 5 states have call successors, (28) Word has length 187 [2025-03-04 02:55:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:55:30,528 INFO L225 Difference]: With dead ends: 320 [2025-03-04 02:55:30,528 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 02:55:30,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2025-03-04 02:55:30,530 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 258 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:55:30,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1517 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 02:55:30,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 02:55:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2025-03-04 02:55:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 138 states have internal predecessors, (153), 48 states have call successors, (48), 19 states have call predecessors, (48), 22 states have return successors, (53), 48 states have call predecessors, (53), 47 states have call successors, (53) [2025-03-04 02:55:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 254 transitions. [2025-03-04 02:55:30,542 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 254 transitions. Word has length 187 [2025-03-04 02:55:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:55:30,543 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 254 transitions. [2025-03-04 02:55:30,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 10.0) internal successors, (90), 10 states have internal predecessors, (90), 5 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (28), 4 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-04 02:55:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 254 transitions. [2025-03-04 02:55:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 02:55:30,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:55:30,546 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:30,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 02:55:30,746 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,SelfDestructingSolverStorable7 [2025-03-04 02:55:30,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:55:30,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:55:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1068371149, now seen corresponding path program 2 times [2025-03-04 02:55:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:55:30,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810445143] [2025-03-04 02:55:30,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:55:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms