./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 60df7e35dcff08963d901f2f5294003ca0b3fa53fdb8a894278bffc5d6309871 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:52:43,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:52:43,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:52:43,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:52:43,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:52:43,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:52:43,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:52:43,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:52:43,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:52:43,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:52:43,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:52:43,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:52:43,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:52:43,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:52:43,615 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:52:43,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:52:43,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:52:43,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:52:43,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:52:43,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:52:43,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:52:43,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:52:43,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:52:43,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:52:43,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:52:43,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:52:43,618 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 -> 60df7e35dcff08963d901f2f5294003ca0b3fa53fdb8a894278bffc5d6309871 [2025-03-04 02:52:43,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:52:43,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:52:43,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:52:43,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:52:43,865 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:52:43,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness_negated.i [2025-03-04 02:52:45,026 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603fc60d3/4e3984c1cf1848809cc42db2d4d731bf/FLAG7a5549524 [2025-03-04 02:52:45,426 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:52:45,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness_negated.i [2025-03-04 02:52:45,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603fc60d3/4e3984c1cf1848809cc42db2d4d731bf/FLAG7a5549524 [2025-03-04 02:52:45,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603fc60d3/4e3984c1cf1848809cc42db2d4d731bf [2025-03-04 02:52:45,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:52:45,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:52:45,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:52:45,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:52:45,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:52:45,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:45" (1/1) ... [2025-03-04 02:52:45,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596c1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:45, skipping insertion in model container [2025-03-04 02:52:45,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:52:45" (1/1) ... [2025-03-04 02:52:45,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:52:45,750 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_iter_delete_harness_negated.i[4494,4507] [2025-03-04 02:52:45,756 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_iter_delete_harness_negated.i[4554,4567] [2025-03-04 02:52:46,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,357 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,357 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,358 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,362 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:46,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,004 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,005 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,021 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,022 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,027 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,028 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,045 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,046 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,047 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,048 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,081 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_iter_delete_harness_negated.i[228285,228298] [2025-03-04 02:52:47,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:52:47,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:52:47,118 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_iter_delete_harness_negated.i[4494,4507] [2025-03-04 02:52:47,122 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_iter_delete_harness_negated.i[4554,4567] [2025-03-04 02:52:47,158 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,158 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,158 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,159 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,159 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,167 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,167 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,168 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,168 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,170 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,170 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,171 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,171 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7526-7537] [2025-03-04 02:52:47,338 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,339 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,357 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:52:47,381 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_iter_delete_harness_negated.i[228285,228298] [2025-03-04 02:52:47,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:52:47,554 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:52:47,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47 WrapperNode [2025-03-04 02:52:47,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:52:47,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:52:47,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:52:47,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:52:47,564 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:52:47" (1/1) ... [2025-03-04 02:52:47,643 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:52:47" (1/1) ... [2025-03-04 02:52:47,705 INFO L138 Inliner]: procedures = 763, calls = 2455, calls flagged for inlining = 67, calls inlined = 11, statements flattened = 747 [2025-03-04 02:52:47,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:52:47,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:52:47,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:52:47,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:52:47,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,794 INFO L175 MemorySlicer]: Split 348 memory accesses to 9 slices as follows [238, 2, 2, 40, 45, 13, 1, 2, 5]. 68 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [6, 0, 2, 9, 0, 0, 0, 0, 5]. The 246 writes are split as follows [232, 1, 0, 4, 6, 1, 1, 1, 0]. [2025-03-04 02:52:47,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:52:47,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:52:47,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:52:47,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:52:47,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (1/1) ... [2025-03-04 02:52:47,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:52:47,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:52:47,927 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:52:47,930 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:52:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 02:52:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 02:52:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 02:52:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 02:52:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 02:52:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 02:52:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 02:52:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 02:52:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 02:52:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-04 02:52:47,953 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-04 02:52:47,953 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:52:47,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:52:47,953 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-04 02:52:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-04 02:52:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:52:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:52:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-03-04 02:52:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-04 02:52:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 02:52:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 02:52:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 02:52:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 02:52:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 02:52:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 02:52:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 02:52:47,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 02:52:47,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 02:52:47,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:52:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2025-03-04 02:52:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-04 02:52:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-04 02:52:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 02:52:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-04 02:52:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-04 02:52:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 02:52:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2025-03-04 02:52:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_delete [2025-03-04 02:52:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_delete [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 02:52:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-04 02:52:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-04 02:52:48,332 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:52:48,334 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:52:48,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc #t~malloc588.base, #t~malloc588.offset; [2025-03-04 02:52:48,387 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-04 02:52:48,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 02:52:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9110-1: assume false; [2025-03-04 02:52:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9110-1: assume !false; [2025-03-04 02:52:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9606-1: assume false; [2025-03-04 02:52:48,537 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9606-1: assume !false; [2025-03-04 02:52:48,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10069: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-04 02:52:48,726 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9956: havoc #t~mem1489.base, #t~mem1489.offset;havoc #t~short1490;havoc #t~mem1491.base, #t~mem1491.offset;havoc #t~ret1492;havoc #t~short1493; [2025-03-04 02:52:48,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-04 02:52:48,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-04 02:52:48,755 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-04 02:52:53,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6821: 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:52:53,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc hash_table_state_has_an_empty_slot_#t~mem571#1; [2025-03-04 02:52:53,899 INFO L? ?]: Removed 222 outVars from TransFormulas that were not future-live. [2025-03-04 02:52:53,899 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:52:53,914 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:52:53,914 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:52:53,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:53 BoogieIcfgContainer [2025-03-04 02:52:53,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:52:53,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:52:53,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:52:53,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:52:53,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:52:45" (1/3) ... [2025-03-04 02:52:53,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f341774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:53, skipping insertion in model container [2025-03-04 02:52:53,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:52:47" (2/3) ... [2025-03-04 02:52:53,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f341774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:52:53, skipping insertion in model container [2025-03-04 02:52:53,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:52:53" (3/3) ... [2025-03-04 02:52:53,921 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_delete_harness_negated.i [2025-03-04 02:52:53,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:52:53,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_iter_delete_harness_negated.i that has 28 procedures, 255 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-03-04 02:52:53,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:52:53,984 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;@5d345b07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:52:53,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:52:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 150 states have (on average 1.28) internal successors, (192), 149 states have internal predecessors, (192), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 02:52:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 02:52:54,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:52:54,000 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:52:54,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:52:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:52:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -792968904, now seen corresponding path program 1 times [2025-03-04 02:52:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:52:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968704333] [2025-03-04 02:52:54,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:52:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:52:58,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 02:52:58,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 02:52:58,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:52:58,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:52:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [2025-03-04 02:52:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:52:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968704333] [2025-03-04 02:52:59,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968704333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:52:59,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268220765] [2025-03-04 02:52:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:52:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:52:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:52:59,191 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:52:59,193 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:53:03,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 02:53:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 02:53:04,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:04,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:04,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 4566 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 02:53:04,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:53:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2025-03-04 02:53:04,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:53:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268220765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:53:04,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 02:53:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503007768] [2025-03-04 02:53:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:04,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:53:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:04,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:53:04,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:53:04,166 INFO L87 Difference]: Start difference. First operand has 223 states, 150 states have (on average 1.28) internal successors, (192), 149 states have internal predecessors, (192), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 02:53:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:04,247 INFO L93 Difference]: Finished difference Result 441 states and 634 transitions. [2025-03-04 02:53:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:53:04,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-04 02:53:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:04,259 INFO L225 Difference]: With dead ends: 441 [2025-03-04 02:53:04,259 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 02:53:04,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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:53:04,269 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:04,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:53:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 02:53:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 02:53:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 144 states have (on average 1.25) internal successors, (180), 145 states have internal predecessors, (180), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-04 02:53:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 287 transitions. [2025-03-04 02:53:04,332 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 287 transitions. Word has length 203 [2025-03-04 02:53:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:04,333 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 287 transitions. [2025-03-04 02:53:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 02:53:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 287 transitions. [2025-03-04 02:53:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 02:53:04,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:04,339 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:53:04,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 02:53:04,540 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:53:04,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1617270059, now seen corresponding path program 1 times [2025-03-04 02:53:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:04,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178260472] [2025-03-04 02:53:04,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:08,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 02:53:08,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 02:53:08,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2025-03-04 02:53:09,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:09,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178260472] [2025-03-04 02:53:09,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178260472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:09,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:09,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:53:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052783583] [2025-03-04 02:53:09,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:09,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:53:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:09,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:53:09,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:53:09,494 INFO L87 Difference]: Start difference. First operand 218 states and 287 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 02:53:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:09,782 INFO L93 Difference]: Finished difference Result 399 states and 529 transitions. [2025-03-04 02:53:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:53:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-04 02:53:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:09,788 INFO L225 Difference]: With dead ends: 399 [2025-03-04 02:53:09,788 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 02:53:09,789 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:53:09,789 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 0 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:09,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1120 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:53:09,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 02:53:09,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 02:53:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 148 states have (on average 1.2432432432432432) internal successors, (184), 149 states have internal predecessors, (184), 54 states have call successors, (54), 19 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 53 states have call successors, (54) [2025-03-04 02:53:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 292 transitions. [2025-03-04 02:53:09,811 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 292 transitions. Word has length 203 [2025-03-04 02:53:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 292 transitions. [2025-03-04 02:53:09,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-04 02:53:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 292 transitions. [2025-03-04 02:53:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 02:53:09,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:09,814 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:53:09,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:53:09,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:09,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:09,815 INFO L85 PathProgramCache]: Analyzing trace with hash 662163998, now seen corresponding path program 1 times [2025-03-04 02:53:09,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:09,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949621450] [2025-03-04 02:53:09,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:13,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 02:53:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 02:53:13,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:13,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:17,386 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2025-03-04 02:53:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:17,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949621450] [2025-03-04 02:53:17,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949621450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:17,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:17,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:53:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41140320] [2025-03-04 02:53:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:17,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:53:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:17,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:53:17,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:53:17,388 INFO L87 Difference]: Start difference. First operand 223 states and 292 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-04 02:53:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:19,746 INFO L93 Difference]: Finished difference Result 393 states and 522 transitions. [2025-03-04 02:53:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:53:19,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 209 [2025-03-04 02:53:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:19,749 INFO L225 Difference]: With dead ends: 393 [2025-03-04 02:53:19,749 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 02:53:19,750 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:53:19,751 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 22 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:19,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1795 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 02:53:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 02:53:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2025-03-04 02:53:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 152 states have (on average 1.243421052631579) internal successors, (189), 154 states have internal predecessors, (189), 54 states have call successors, (54), 19 states have call predecessors, (54), 21 states have return successors, (55), 54 states have call predecessors, (55), 53 states have call successors, (55) [2025-03-04 02:53:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 298 transitions. [2025-03-04 02:53:19,767 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 298 transitions. Word has length 209 [2025-03-04 02:53:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:19,768 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 298 transitions. [2025-03-04 02:53:19,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 9 states have internal predecessors, (78), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-03-04 02:53:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 298 transitions. [2025-03-04 02:53:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 02:53:19,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:19,770 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:53:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:53:19,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:19,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:19,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1755534403, now seen corresponding path program 1 times [2025-03-04 02:53:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678040191] [2025-03-04 02:53:19,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:23,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 02:53:23,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 02:53:23,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:23,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2025-03-04 02:53:24,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:24,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678040191] [2025-03-04 02:53:24,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678040191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:53:24,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:53:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:53:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742343863] [2025-03-04 02:53:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:53:24,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:53:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:24,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:53:24,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:53:24,702 INFO L87 Difference]: Start difference. First operand 228 states and 298 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-04 02:53:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:53:25,065 INFO L93 Difference]: Finished difference Result 400 states and 530 transitions. [2025-03-04 02:53:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:53:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 209 [2025-03-04 02:53:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:53:25,069 INFO L225 Difference]: With dead ends: 400 [2025-03-04 02:53:25,069 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 02:53:25,070 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:53:25,072 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 21 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 02:53:25,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 796 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 02:53:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 02:53:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2025-03-04 02:53:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 153 states have (on average 1.2418300653594772) internal successors, (190), 155 states have internal predecessors, (190), 55 states have call successors, (55), 19 states have call predecessors, (55), 21 states have return successors, (56), 55 states have call predecessors, (56), 54 states have call successors, (56) [2025-03-04 02:53:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 301 transitions. [2025-03-04 02:53:25,087 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 301 transitions. Word has length 209 [2025-03-04 02:53:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:53:25,088 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 301 transitions. [2025-03-04 02:53:25,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-04 02:53:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2025-03-04 02:53:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 02:53:25,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:53:25,090 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:25,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:53:25,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:53:25,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:53:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash -394577169, now seen corresponding path program 1 times [2025-03-04 02:53:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:53:25,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367248739] [2025-03-04 02:53:25,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:53:28,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 02:53:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 02:53:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-04 02:53:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:53:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367248739] [2025-03-04 02:53:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367248739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:53:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814723997] [2025-03-04 02:53:30,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:53:30,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:53:30,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:53:30,757 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:53:30,758 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:53:34,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 02:53:35,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 02:53:35,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:53:35,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:53:35,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 4594 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 02:53:35,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:53:36,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:53:42,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:53:42,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:53:49,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2025-03-04 02:53:49,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-04 02:53:49,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 02:53:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 547 proven. 4 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-04 02:53:50,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:53:53,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-04 02:53:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2025-03-04 02:53:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814723997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:53:54,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:53:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 22 [2025-03-04 02:53:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447718448] [2025-03-04 02:53:54,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:53:54,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 02:53:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:53:54,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 02:53:54,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-03-04 02:53:54,693 INFO L87 Difference]: Start difference. First operand 230 states and 301 transitions. Second operand has 22 states, 20 states have (on average 7.55) internal successors, (151), 19 states have internal predecessors, (151), 10 states have call successors, (86), 6 states have call predecessors, (86), 7 states have return successors, (81), 8 states have call predecessors, (81), 9 states have call successors, (81) [2025-03-04 02:53:58,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 02:54:08,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]