./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_init_bounded_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 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:06:48,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:06:48,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:06:48,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:06:48,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:06:48,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:06:48,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:06:48,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:06:48,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:06:48,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:06:48,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:06:48,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:06:48,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:06:48,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:06:48,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:06:48,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:06:48,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:06:48,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:06:48,229 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 -> 658cf0e5cfa8ff565239cc21b84be4a008587cc5aba3b9c9a0b23efea938ab87 [2025-03-08 18:06:48,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:06:48,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:06:48,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:06:48,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:06:48,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:06:48,512 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_init_bounded_harness.i [2025-03-08 18:06:49,724 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f243e8db/d5526d6d068b4cf1a5125ec778f62e37/FLAGd7ee81eed [2025-03-08 18:06:50,214 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:06:50,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_init_bounded_harness.i [2025-03-08 18:06:50,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f243e8db/d5526d6d068b4cf1a5125ec778f62e37/FLAGd7ee81eed [2025-03-08 18:06:50,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f243e8db/d5526d6d068b4cf1a5125ec778f62e37 [2025-03-08 18:06:50,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:06:50,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:06:50,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:06:50,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:06:50,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:06:50,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:06:50" (1/1) ... [2025-03-08 18:06:50,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d5f24a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:50, skipping insertion in model container [2025-03-08 18:06:50,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:06:50" (1/1) ... [2025-03-08 18:06:50,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:06:50,665 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_init_bounded_harness.i[4501,4514] [2025-03-08 18:06:50,674 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_init_bounded_harness.i[4561,4574] [2025-03-08 18:06:51,757 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,758 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,759 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,767 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,769 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:51,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,504 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,505 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,534 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,535 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,541 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,541 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,556 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,559 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,592 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_init_bounded_harness.i[227778,227791] [2025-03-08 18:06:52,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:06:52,623 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:06:52,634 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_init_bounded_harness.i[4501,4514] [2025-03-08 18:06:52,638 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_init_bounded_harness.i[4561,4574] [2025-03-08 18:06:52,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,674 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,675 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,675 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,682 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,683 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,683 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,684 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,685 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,685 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,750 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7558-7569] [2025-03-08 18:06:52,849 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,850 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,856 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,857 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,858 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,859 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,867 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,868 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:06:52,884 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_init_bounded_harness.i[227778,227791] [2025-03-08 18:06:52,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:06:53,032 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:06:53,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53 WrapperNode [2025-03-08 18:06:53,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:06:53,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:06:53,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:06:53,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:06:53,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,185 INFO L138 Inliner]: procedures = 763, calls = 2426, calls flagged for inlining = 67, calls inlined = 13, statements flattened = 854 [2025-03-08 18:06:53,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:06:53,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:06:53,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:06:53,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:06:53,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,215 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 18:06:53,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:06:53,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:06:53,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:06:53,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:06:53,290 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (1/1) ... [2025-03-08 18:06:53,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:06:53,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:06:53,316 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-08 18:06:53,319 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-08 18:06:53,337 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2025-03-08 18:06:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2025-03-08 18:06:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 18:06:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:06:53,338 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-03-08 18:06:53,338 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-03-08 18:06:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2025-03-08 18:06:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-03-08 18:06:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:06:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 18:06:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2025-03-08 18:06:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2025-03-08 18:06:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:06:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:06:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2025-03-08 18:06:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2025-03-08 18:06:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 18:06:53,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:06:53,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:06:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-03-08 18:06:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-03-08 18:06:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-03-08 18:06:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-03-08 18:06:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-08 18:06:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:06:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:06:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:06:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-03-08 18:06:53,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2025-03-08 18:06:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-03-08 18:06:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-03-08 18:06:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-03-08 18:06:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:06:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2025-03-08 18:06:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2025-03-08 18:06:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 18:06:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2025-03-08 18:06:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2025-03-08 18:06:53,600 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:06:53,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:06:53,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9990: 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-08 18:06:53,637 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-03-08 18:06:53,659 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10103: call ULTIMATE.dealloc(~#elemsize~0.base, ~#elemsize~0.offset);havoc ~#elemsize~0.base, ~#elemsize~0.offset; [2025-03-08 18:06:53,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6940: havoc bounded_calloc_#t~malloc587#1.base, bounded_calloc_#t~malloc587#1.offset;call ULTIMATE.dealloc(bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset);havoc bounded_calloc_~#required_bytes~1#1.base, bounded_calloc_~#required_bytes~1#1.offset; [2025-03-08 18:06:53,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc #t~ret589#1;havoc #t~ite591#1.base, #t~ite591#1.offset;havoc #t~ret590#1.base, #t~ret590#1.offset; [2025-03-08 18:06:53,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9183: call ULTIMATE.dealloc(~#size~0#1.base, ~#size~0#1.offset);havoc ~#size~0#1.base, ~#size~0#1.offset; [2025-03-08 18:06:53,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc aws_round_up_to_power_of_two_#t~ret62#1; [2025-03-08 18:06:53,820 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc #t~ret600.base, #t~ret600.offset; [2025-03-08 18:06:53,824 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-03-08 18:06:53,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: havoc #t~ret57#1; [2025-03-08 18:06:53,840 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:06:54,029 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7009: call ULTIMATE.dealloc(aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset);havoc aws_mem_calloc_~#required_bytes~2#1.base, aws_mem_calloc_~#required_bytes~2#1.offset; [2025-03-08 18:06:54,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9154: call ULTIMATE.dealloc(~#required_bytes~3#1.base, ~#required_bytes~3#1.offset);havoc ~#required_bytes~3#1.base, ~#required_bytes~3#1.offset; [2025-03-08 18:06:54,049 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc #t~bitwise60;havoc #t~short61; [2025-03-08 18:06:54,059 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: havoc #t~ret59#1; [2025-03-08 18:06:59,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9242-1: assume false; [2025-03-08 18:06:59,590 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9242-1: assume !false; [2025-03-08 18:06:59,683 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2025-03-08 18:06:59,684 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:06:59,705 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:06:59,706 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:06:59,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:06:59 BoogieIcfgContainer [2025-03-08 18:06:59,706 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:06:59,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:06:59,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:06:59,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:06:59,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:06:50" (1/3) ... [2025-03-08 18:06:59,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb7a605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:06:59, skipping insertion in model container [2025-03-08 18:06:59,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:06:53" (2/3) ... [2025-03-08 18:06:59,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb7a605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:06:59, skipping insertion in model container [2025-03-08 18:06:59,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:06:59" (3/3) ... [2025-03-08 18:06:59,715 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_hash_table_init_bounded_harness.i [2025-03-08 18:06:59,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:06:59,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_hash_table_init_bounded_harness.i that has 20 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 18:06:59,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:06:59,785 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;@4082102e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:06:59,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:06:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 147 states have (on average 1.2653061224489797) internal successors, (186), 147 states have internal predecessors, (186), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 18:06:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:06:59,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:06:59,800 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:06:59,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:06:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:06:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 221123891, now seen corresponding path program 1 times [2025-03-08 18:06:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:06:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311735801] [2025-03-08 18:06:59,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:06:59,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:04,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:07:04,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:07:04,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:04,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 18:07:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311735801] [2025-03-08 18:07:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311735801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:07:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611047921] [2025-03-08 18:07:04,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:07:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:07:04,917 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-08 18:07:04,919 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-08 18:07:08,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:07:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:07:09,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:09,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 4103 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:07:09,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:07:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 18:07:09,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:07:09,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611047921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:09,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:07:09,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:07:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548526928] [2025-03-08 18:07:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:09,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:07:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:09,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:07:09,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:07:09,428 INFO L87 Difference]: Start difference. First operand has 206 states, 147 states have (on average 1.2653061224489797) internal successors, (186), 147 states have internal predecessors, (186), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:09,547 INFO L93 Difference]: Finished difference Result 401 states and 536 transitions. [2025-03-08 18:07:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:07:09,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-08 18:07:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:09,554 INFO L225 Difference]: With dead ends: 401 [2025-03-08 18:07:09,556 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 18:07:09,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-08 18:07:09,565 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:09,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:07:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 18:07:09,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 18:07:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 139 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 249 transitions. [2025-03-08 18:07:09,622 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 249 transitions. Word has length 76 [2025-03-08 18:07:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:09,623 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 249 transitions. [2025-03-08 18:07:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 249 transitions. [2025-03-08 18:07:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:07:09,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:09,625 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:07:09,642 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-08 18:07:09,828 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-08 18:07:09,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:09,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2035710192, now seen corresponding path program 1 times [2025-03-08 18:07:09,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:09,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309296616] [2025-03-08 18:07:09,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:09,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:13,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:07:13,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:07:13,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:13,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309296616] [2025-03-08 18:07:14,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309296616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:14,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:14,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:14,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009560016] [2025-03-08 18:07:14,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:14,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:14,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:14,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:14,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:14,475 INFO L87 Difference]: Start difference. First operand 197 states and 249 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:14,781 INFO L93 Difference]: Finished difference Result 339 states and 418 transitions. [2025-03-08 18:07:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:14,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2025-03-08 18:07:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:14,784 INFO L225 Difference]: With dead ends: 339 [2025-03-08 18:07:14,784 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 18:07:14,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:14,785 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:14,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 715 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 18:07:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 18:07:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 141 states have internal predecessors, (174), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 251 transitions. [2025-03-08 18:07:14,798 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 251 transitions. Word has length 76 [2025-03-08 18:07:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:14,798 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 251 transitions. [2025-03-08 18:07:14,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 251 transitions. [2025-03-08 18:07:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 18:07:14,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:14,801 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:07:14,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:07:14,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:14,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1300237359, now seen corresponding path program 1 times [2025-03-08 18:07:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229527070] [2025-03-08 18:07:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:18,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 18:07:18,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 18:07:18,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:18,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229527070] [2025-03-08 18:07:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229527070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:19,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:19,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377673693] [2025-03-08 18:07:19,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:19,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:19,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:19,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:19,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:19,318 INFO L87 Difference]: Start difference. First operand 199 states and 251 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:19,617 INFO L93 Difference]: Finished difference Result 251 states and 309 transitions. [2025-03-08 18:07:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2025-03-08 18:07:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:19,622 INFO L225 Difference]: With dead ends: 251 [2025-03-08 18:07:19,622 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 18:07:19,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:19,622 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 715 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-08 18:07:19,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 715 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 18:07:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 18:07:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 144 states have internal predecessors, (177), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-08 18:07:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 255 transitions. [2025-03-08 18:07:19,639 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 255 transitions. Word has length 78 [2025-03-08 18:07:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 255 transitions. [2025-03-08 18:07:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:07:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 255 transitions. [2025-03-08 18:07:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 18:07:19,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:19,641 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:07:19,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:07:19,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:19,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash -676388783, now seen corresponding path program 1 times [2025-03-08 18:07:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:19,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521005056] [2025-03-08 18:07:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:23,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 18:07:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 18:07:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521005056] [2025-03-08 18:07:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521005056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:23,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:23,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937866853] [2025-03-08 18:07:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:23,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:23,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:23,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:23,953 INFO L87 Difference]: Start difference. First operand 203 states and 255 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:07:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:24,252 INFO L93 Difference]: Finished difference Result 251 states and 308 transitions. [2025-03-08 18:07:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:24,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-08 18:07:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:24,256 INFO L225 Difference]: With dead ends: 251 [2025-03-08 18:07:24,257 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 18:07:24,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:24,257 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:24,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 717 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 18:07:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2025-03-08 18:07:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 141 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2025-03-08 18:07:24,279 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 83 [2025-03-08 18:07:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:24,279 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2025-03-08 18:07:24,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 18:07:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2025-03-08 18:07:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:07:24,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:24,281 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:07:24,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:07:24,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:24,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -627455967, now seen corresponding path program 1 times [2025-03-08 18:07:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:24,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901841850] [2025-03-08 18:07:24,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:27,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:07:27,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:07:27,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:27,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901841850] [2025-03-08 18:07:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901841850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:28,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:28,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442192461] [2025-03-08 18:07:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:28,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:28,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:28,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:28,791 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:07:29,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:29,216 INFO L93 Difference]: Finished difference Result 319 states and 391 transitions. [2025-03-08 18:07:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:29,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-08 18:07:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:29,219 INFO L225 Difference]: With dead ends: 319 [2025-03-08 18:07:29,219 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:29,220 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-08 18:07:29,220 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:29,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 944 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:07:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 18:07:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.2222222222222223) internal successors, (176), 145 states have internal predecessors, (176), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-03-08 18:07:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2025-03-08 18:07:29,232 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 100 [2025-03-08 18:07:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:29,233 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2025-03-08 18:07:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 18:07:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2025-03-08 18:07:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 18:07:29,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:29,234 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:07:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:07:29,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 519981789, now seen corresponding path program 1 times [2025-03-08 18:07:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532545044] [2025-03-08 18:07:29,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:32,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 18:07:33,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 18:07:33,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:33,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 18:07:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532545044] [2025-03-08 18:07:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532545044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534978120] [2025-03-08 18:07:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:35,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:35,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:35,158 INFO L87 Difference]: Start difference. First operand 204 states and 256 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:07:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:35,744 INFO L93 Difference]: Finished difference Result 259 states and 318 transitions. [2025-03-08 18:07:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2025-03-08 18:07:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:35,746 INFO L225 Difference]: With dead ends: 259 [2025-03-08 18:07:35,746 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:35,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:35,747 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:35,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 948 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 18:07:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 18:07:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.2083333333333333) internal successors, (174), 145 states have internal predecessors, (174), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-03-08 18:07:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2025-03-08 18:07:35,759 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 106 [2025-03-08 18:07:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:35,759 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2025-03-08 18:07:35,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 18:07:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2025-03-08 18:07:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 18:07:35,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:35,763 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-08 18:07:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 18:07:35,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:35,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:35,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1386104424, now seen corresponding path program 1 times [2025-03-08 18:07:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:35,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208464908] [2025-03-08 18:07:35,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:35,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:39,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 18:07:39,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 18:07:39,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:39,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:07:40,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:40,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208464908] [2025-03-08 18:07:40,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208464908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:40,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401144425] [2025-03-08 18:07:40,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:40,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:40,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:40,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:40,107 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-08 18:07:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:40,412 INFO L93 Difference]: Finished difference Result 322 states and 390 transitions. [2025-03-08 18:07:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 141 [2025-03-08 18:07:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:40,414 INFO L225 Difference]: With dead ends: 322 [2025-03-08 18:07:40,414 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:40,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:40,415 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:40,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 707 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:07:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2025-03-08 18:07:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.2) internal successors, (168), 141 states have internal predecessors, (168), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 245 transitions. [2025-03-08 18:07:40,428 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 245 transitions. Word has length 141 [2025-03-08 18:07:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:40,429 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 245 transitions. [2025-03-08 18:07:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-08 18:07:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 245 transitions. [2025-03-08 18:07:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 18:07:40,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:40,431 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-08 18:07:40,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 18:07:40,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:40,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash -371590405, now seen corresponding path program 1 times [2025-03-08 18:07:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:40,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150092266] [2025-03-08 18:07:40,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:40,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:43,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 18:07:44,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 18:07:44,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:44,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-08 18:07:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150092266] [2025-03-08 18:07:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150092266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:07:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739804387] [2025-03-08 18:07:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:07:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:44,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:07:44,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:07:44,869 INFO L87 Difference]: Start difference. First operand 199 states and 245 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 18:07:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:45,355 INFO L93 Difference]: Finished difference Result 261 states and 317 transitions. [2025-03-08 18:07:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:07:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2025-03-08 18:07:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:45,359 INFO L225 Difference]: With dead ends: 261 [2025-03-08 18:07:45,359 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:45,359 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-08 18:07:45,359 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:45,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 926 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:07:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-08 18:07:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 145 states have internal predecessors, (172), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (41), 39 states have call predecessors, (41), 38 states have call successors, (41) [2025-03-08 18:07:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 252 transitions. [2025-03-08 18:07:45,370 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 252 transitions. Word has length 147 [2025-03-08 18:07:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:45,370 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 252 transitions. [2025-03-08 18:07:45,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 18:07:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2025-03-08 18:07:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 18:07:45,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:45,374 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-08 18:07:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:07:45,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:45,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1437030025, now seen corresponding path program 1 times [2025-03-08 18:07:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999495524] [2025-03-08 18:07:45,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 18:07:49,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 18:07:49,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:49,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:07:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999495524] [2025-03-08 18:07:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999495524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:50,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 18:07:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536763923] [2025-03-08 18:07:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:50,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:07:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:50,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:07:50,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:50,006 INFO L87 Difference]: Start difference. First operand 204 states and 252 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 18:07:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:50,419 INFO L93 Difference]: Finished difference Result 261 states and 316 transitions. [2025-03-08 18:07:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:07:50,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-03-08 18:07:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:50,421 INFO L225 Difference]: With dead ends: 261 [2025-03-08 18:07:50,421 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 18:07:50,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:07:50,422 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:50,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 702 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:07:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 18:07:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 199. [2025-03-08 18:07:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 141 states have internal predecessors, (167), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 18:07:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 244 transitions. [2025-03-08 18:07:50,432 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 244 transitions. Word has length 153 [2025-03-08 18:07:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:50,432 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 244 transitions. [2025-03-08 18:07:50,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 18:07:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 244 transitions. [2025-03-08 18:07:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 18:07:50,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:50,434 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2025-03-08 18:07:50,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 18:07:50,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1861418207, now seen corresponding path program 1 times [2025-03-08 18:07:50,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551696234] [2025-03-08 18:07:50,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:54,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 18:07:54,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 18:07:54,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:07:54,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:07:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:07:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:07:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551696234] [2025-03-08 18:07:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551696234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:07:55,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:07:55,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:07:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576741056] [2025-03-08 18:07:55,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:07:55,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:07:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:07:55,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:07:55,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:07:55,578 INFO L87 Difference]: Start difference. First operand 199 states and 244 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 18:07:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:07:56,189 INFO L93 Difference]: Finished difference Result 263 states and 316 transitions. [2025-03-08 18:07:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:07:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-03-08 18:07:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:07:56,191 INFO L225 Difference]: With dead ends: 263 [2025-03-08 18:07:56,191 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 18:07:56,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:07:56,191 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:07:56,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1146 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 18:07:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 18:07:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2025-03-08 18:07:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 144 states have (on average 1.1875) internal successors, (171), 145 states have internal predecessors, (171), 39 states have call successors, (39), 19 states have call predecessors, (39), 20 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-08 18:07:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 249 transitions. [2025-03-08 18:07:56,202 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 249 transitions. Word has length 160 [2025-03-08 18:07:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:07:56,203 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 249 transitions. [2025-03-08 18:07:56,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 18:07:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 249 transitions. [2025-03-08 18:07:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 18:07:56,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:07:56,204 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1] [2025-03-08 18:07:56,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 18:07:56,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:07:56,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:07:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2014153048, now seen corresponding path program 1 times [2025-03-08 18:07:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:07:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885293125] [2025-03-08 18:07:56,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:07:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:07:59,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 18:08:00,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 18:08:00,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:00,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 18:08:02,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885293125] [2025-03-08 18:08:02,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885293125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:02,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:02,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:08:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372765044] [2025-03-08 18:08:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:08:02,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:02,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:08:02,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:02,095 INFO L87 Difference]: Start difference. First operand 204 states and 249 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 18:08:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:03,476 INFO L93 Difference]: Finished difference Result 262 states and 314 transitions. [2025-03-08 18:08:03,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:08:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 166 [2025-03-08 18:08:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:03,478 INFO L225 Difference]: With dead ends: 262 [2025-03-08 18:08:03,478 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 18:08:03,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:08:03,479 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:03,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1601 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 18:08:03,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 18:08:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-08 18:08:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 140 states have internal predecessors, (164), 38 states have call successors, (38), 19 states have call predecessors, (38), 19 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 18:08:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 239 transitions. [2025-03-08 18:08:03,488 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 239 transitions. Word has length 166 [2025-03-08 18:08:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:03,488 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 239 transitions. [2025-03-08 18:08:03,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-08 18:08:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 239 transitions. [2025-03-08 18:08:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 18:08:03,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:03,491 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:08:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 18:08:03,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:03,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 51684915, now seen corresponding path program 1 times [2025-03-08 18:08:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610327686] [2025-03-08 18:08:03,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 18:08:07,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 18:08:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:07,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-08 18:08:12,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:12,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610327686] [2025-03-08 18:08:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610327686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:12,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:08:12,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 18:08:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264974708] [2025-03-08 18:08:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:08:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:12,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:08:12,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:08:12,479 INFO L87 Difference]: Start difference. First operand 197 states and 239 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 18:08:16,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []