./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya --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 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:28:46,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:28:46,914 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 05:28:46,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:28:46,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:28:46,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:28:46,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:28:46,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:28:46,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:28:46,949 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:28:46,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:28:46,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:28:46,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:28:46,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:28:46,952 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:28:46,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:28:46,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:28:46,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:28:46,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:28:46,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:28:46,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:28:46,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:28:46,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:28:46,960 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:28:46,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:28:46,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:28:46,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:28:46,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:28:46,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:28:46,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:28:46,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:28:46,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:28:46,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:28:46,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:28:46,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:28:46,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:28:46,964 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:28:46,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:28:46,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:28:46,965 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 [2023-11-29 05:28:47,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:28:47,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:28:47,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:28:47,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:28:47,254 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:28:47,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2023-11-29 05:28:50,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:28:50,503 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:28:50,504 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2023-11-29 05:28:50,542 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/data/86dfbd017/b44ba7b3cec44188bab4fdea8e1cceda/FLAG63d0f4497 [2023-11-29 05:28:50,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/data/86dfbd017/b44ba7b3cec44188bab4fdea8e1cceda [2023-11-29 05:28:50,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:28:50,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:28:50,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:28:50,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:28:50,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:28:50,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:28:50" (1/1) ... [2023-11-29 05:28:50,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a54cca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:50, skipping insertion in model container [2023-11-29 05:28:50,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:28:50" (1/1) ... [2023-11-29 05:28:50,698 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:28:51,892 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2023-11-29 05:28:52,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:28:52,069 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:28:52,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [2452] [2023-11-29 05:28:52,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [2455] [2023-11-29 05:28:52,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [2458] [2023-11-29 05:28:52,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [2461] [2023-11-29 05:28:52,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [2613] [2023-11-29 05:28:52,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [2621] [2023-11-29 05:28:52,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret), "+m" (tmp___2->state): : "memory", "cc"); [2899-2900] [2023-11-29 05:28:52,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret), "+m" (tmp___3->state): : "memory", "cc"); [2904-2905] [2023-11-29 05:28:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret), "+m" (tmp___4->state): : "memory", "cc"); [2909-2910] [2023-11-29 05:28:52,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret), "+m" (tmp___5->state): : "memory", "cc"); [2914-2915] [2023-11-29 05:28:52,191 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret), "+m" (tmp___4->state): : "memory", "cc"); [3218-3219] [2023-11-29 05:28:52,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret), "+m" (tmp___5->state): : "memory", "cc"); [3223-3224] [2023-11-29 05:28:52,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret), "+m" (tmp___6->state): : "memory", "cc"); [3228-3229] [2023-11-29 05:28:52,193 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret), "+m" (tmp___7->state): : "memory", "cc"); [3233-3234] [2023-11-29 05:28:52,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgb %b0, %1\n": "+q" (__ret___0), "+m" (tmp___15->state): : "memory", "cc"); [3313-3314] [2023-11-29 05:28:52,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgw %w0, %1\n": "+r" (__ret___0), "+m" (tmp___16->state): : "memory", "cc"); [3318-3319] [2023-11-29 05:28:52,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgl %0, %1\n": "+r" (__ret___0), "+m" (tmp___17->state): : "memory", "cc"); [3323-3324] [2023-11-29 05:28:52,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("xchgq %q0, %1\n": "+r" (__ret___0), "+m" (tmp___18->state): : "memory", "cc"); [3328-3329] [2023-11-29 05:28:52,333 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2023-11-29 05:28:52,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:28:52,496 WARN L675 CHandler]: The function __xchg_wrong_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:28:52,496 WARN L675 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:28:52,496 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:28:52,505 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:28:52,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52 WrapperNode [2023-11-29 05:28:52,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:28:52,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:28:52,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:28:52,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:28:52,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,706 INFO L138 Inliner]: procedures = 199, calls = 2245, calls flagged for inlining = 73, calls inlined = 51, statements flattened = 3343 [2023-11-29 05:28:52,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:28:52,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:28:52,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:28:52,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:28:52,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,899 INFO L175 MemorySlicer]: Split 1107 memory accesses to 33 slices as follows [231, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 5, 6, 3, 3, 7, 20, 4, 305, 4, 113, 4, 113, 4, 23, 2, 20, 3, 186, 3, 1, 10]. 28 percent of accesses are in the largest equivalence class. The 638 initializations are split as follows [0, 4, 4, 4, 4, 3, 3, 3, 3, 2, 3, 3, 5, 5, 3, 3, 5, 16, 4, 288, 4, 96, 4, 96, 4, 23, 2, 0, 0, 44, 0, 0, 0]. The 310 writes are split as follows [198, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 2, 81, 3, 0, 10]. [2023-11-29 05:28:52,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:52,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:53,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:53,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:53,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:28:53,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:28:53,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:28:53,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:28:53,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (1/1) ... [2023-11-29 05:28:53,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:28:53,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:28:53,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:28:53,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:28:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2023-11-29 05:28:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2023-11-29 05:28:53,128 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2023-11-29 05:28:53,128 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2023-11-29 05:28:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2023-11-29 05:28:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 05:28:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 05:28:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-29 05:28:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-29 05:28:53,129 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2023-11-29 05:28:53,129 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2023-11-29 05:28:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 05:28:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 05:28:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2023-11-29 05:28:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2023-11-29 05:28:53,130 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2023-11-29 05:28:53,130 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2023-11-29 05:28:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 05:28:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 05:28:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2023-11-29 05:28:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2023-11-29 05:28:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:28:53,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:28:53,131 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2023-11-29 05:28:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2023-11-29 05:28:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-11-29 05:28:53,132 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-11-29 05:28:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:28:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:28:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:28:53,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 05:28:53,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-11-29 05:28:53,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2023-11-29 05:28:53,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#27 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#28 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#29 [2023-11-29 05:28:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#30 [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#31 [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#32 [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-29 05:28:53,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:28:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 05:28:53,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2023-11-29 05:28:53,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2023-11-29 05:28:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#27 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#28 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#29 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#30 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#31 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#32 [2023-11-29 05:28:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 05:28:53,141 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 05:28:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2023-11-29 05:28:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2023-11-29 05:28:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2023-11-29 05:28:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2023-11-29 05:28:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2023-11-29 05:28:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2023-11-29 05:28:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2023-11-29 05:28:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 05:28:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-11-29 05:28:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2023-11-29 05:28:53,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2023-11-29 05:28:53,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2023-11-29 05:28:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2023-11-29 05:28:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2023-11-29 05:28:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2023-11-29 05:28:53,147 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2023-11-29 05:28:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:28:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:28:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:28:53,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 05:28:53,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2023-11-29 05:28:53,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2023-11-29 05:28:53,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2023-11-29 05:28:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2023-11-29 05:28:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2023-11-29 05:28:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2023-11-29 05:28:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2023-11-29 05:28:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2023-11-29 05:28:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2023-11-29 05:28:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 05:28:53,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 05:28:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-11-29 05:28:53,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-11-29 05:28:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:28:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2023-11-29 05:28:53,152 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2023-11-29 05:28:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:28:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2023-11-29 05:28:53,152 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2023-11-29 05:28:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 05:28:53,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-11-29 05:28:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2023-11-29 05:28:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#27 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#28 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#29 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#30 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#31 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#32 [2023-11-29 05:28:53,156 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2023-11-29 05:28:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2023-11-29 05:28:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-29 05:28:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2023-11-29 05:28:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2023-11-29 05:28:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2023-11-29 05:28:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2023-11-29 05:28:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2023-11-29 05:28:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2023-11-29 05:28:53,157 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2023-11-29 05:28:53,157 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2023-11-29 05:28:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 05:28:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 05:28:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2023-11-29 05:28:53,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2023-11-29 05:28:53,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2023-11-29 05:28:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2023-11-29 05:28:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2023-11-29 05:28:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2023-11-29 05:28:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:28:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:28:53,162 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2023-11-29 05:28:53,162 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2023-11-29 05:28:53,723 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:28:53,727 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:28:53,764 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 05:29:09,007 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:29:09,259 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:29:09,259 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:29:09,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:29:09 BoogieIcfgContainer [2023-11-29 05:29:09,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:29:09,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:29:09,264 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:29:09,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:29:09,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:28:50" (1/3) ... [2023-11-29 05:29:09,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c13354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:29:09, skipping insertion in model container [2023-11-29 05:29:09,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:28:52" (2/3) ... [2023-11-29 05:29:09,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c13354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:29:09, skipping insertion in model container [2023-11-29 05:29:09,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:29:09" (3/3) ... [2023-11-29 05:29:09,270 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2023-11-29 05:29:09,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:29:09,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:29:09,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:29:09,379 INFO L357 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, mHoare=true, 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;@75c224de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:29:09,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:29:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 772 states, 556 states have (on average 1.5233812949640289) internal successors, (847), 570 states have internal predecessors, (847), 181 states have call successors, (181), 34 states have call predecessors, (181), 33 states have return successors, (177), 177 states have call predecessors, (177), 177 states have call successors, (177) [2023-11-29 05:29:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:29:09,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:09,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:09,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:09,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1335882488, now seen corresponding path program 1 times [2023-11-29 05:29:09,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:09,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272187965] [2023-11-29 05:29:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:29:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:29:10,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:10,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272187965] [2023-11-29 05:29:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272187965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:10,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:29:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407936072] [2023-11-29 05:29:10,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:10,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:10,196 INFO L87 Difference]: Start difference. First operand has 772 states, 556 states have (on average 1.5233812949640289) internal successors, (847), 570 states have internal predecessors, (847), 181 states have call successors, (181), 34 states have call predecessors, (181), 33 states have return successors, (177), 177 states have call predecessors, (177), 177 states have call successors, (177) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:10,900 INFO L93 Difference]: Finished difference Result 2255 states and 3557 transitions. [2023-11-29 05:29:10,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:10,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-29 05:29:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:10,934 INFO L225 Difference]: With dead ends: 2255 [2023-11-29 05:29:10,934 INFO L226 Difference]: Without dead ends: 1472 [2023-11-29 05:29:10,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:10,950 INFO L413 NwaCegarLoop]: 1949 mSDtfsCounter, 1167 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:10,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 3008 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:29:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2023-11-29 05:29:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1468. [2023-11-29 05:29:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1068 states have (on average 1.5084269662921348) internal successors, (1611), 1080 states have internal predecessors, (1611), 335 states have call successors, (335), 65 states have call predecessors, (335), 64 states have return successors, (330), 330 states have call predecessors, (330), 330 states have call successors, (330) [2023-11-29 05:29:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2276 transitions. [2023-11-29 05:29:11,143 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2276 transitions. Word has length 15 [2023-11-29 05:29:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:11,143 INFO L495 AbstractCegarLoop]: Abstraction has 1468 states and 2276 transitions. [2023-11-29 05:29:11,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:11,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2276 transitions. [2023-11-29 05:29:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 05:29:11,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:11,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:11,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:29:11,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:11,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:11,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2117468004, now seen corresponding path program 1 times [2023-11-29 05:29:11,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335172431] [2023-11-29 05:29:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:29:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:29:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335172431] [2023-11-29 05:29:11,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335172431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:11,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:11,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:29:11,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74275533] [2023-11-29 05:29:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:11,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:29:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:11,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:29:11,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:11,384 INFO L87 Difference]: Start difference. First operand 1468 states and 2276 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:11,928 INFO L93 Difference]: Finished difference Result 4184 states and 6469 transitions. [2023-11-29 05:29:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:29:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-11-29 05:29:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:11,954 INFO L225 Difference]: With dead ends: 4184 [2023-11-29 05:29:11,955 INFO L226 Difference]: Without dead ends: 2717 [2023-11-29 05:29:11,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:29:11,965 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 1000 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:11,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 2204 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:29:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2023-11-29 05:29:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2704. [2023-11-29 05:29:12,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 1955 states have (on average 1.4900255754475704) internal successors, (2913), 1975 states have internal predecessors, (2913), 635 states have call successors, (635), 114 states have call predecessors, (635), 113 states have return successors, (630), 630 states have call predecessors, (630), 630 states have call successors, (630) [2023-11-29 05:29:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 4178 transitions. [2023-11-29 05:29:12,158 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 4178 transitions. Word has length 22 [2023-11-29 05:29:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:12,159 INFO L495 AbstractCegarLoop]: Abstraction has 2704 states and 4178 transitions. [2023-11-29 05:29:12,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 4178 transitions. [2023-11-29 05:29:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 05:29:12,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:12,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:12,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:29:12,162 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:12,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -518395715, now seen corresponding path program 1 times [2023-11-29 05:29:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174899446] [2023-11-29 05:29:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:29:12,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:12,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174899446] [2023-11-29 05:29:12,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174899446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:12,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:12,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:29:12,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187380224] [2023-11-29 05:29:12,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:12,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:29:12,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:12,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:29:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:29:12,562 INFO L87 Difference]: Start difference. First operand 2704 states and 4178 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:15,104 INFO L93 Difference]: Finished difference Result 2714 states and 4199 transitions. [2023-11-29 05:29:15,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:29:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-11-29 05:29:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:15,134 INFO L225 Difference]: With dead ends: 2714 [2023-11-29 05:29:15,134 INFO L226 Difference]: Without dead ends: 2711 [2023-11-29 05:29:15,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:29:15,138 INFO L413 NwaCegarLoop]: 1028 mSDtfsCounter, 1083 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:15,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1720 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 05:29:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2023-11-29 05:29:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2703. [2023-11-29 05:29:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 1955 states have (on average 1.4895140664961637) internal successors, (2912), 1974 states have internal predecessors, (2912), 634 states have call successors, (634), 114 states have call predecessors, (634), 113 states have return successors, (630), 630 states have call predecessors, (630), 630 states have call successors, (630) [2023-11-29 05:29:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 4176 transitions. [2023-11-29 05:29:15,345 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 4176 transitions. Word has length 22 [2023-11-29 05:29:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:15,345 INFO L495 AbstractCegarLoop]: Abstraction has 2703 states and 4176 transitions. [2023-11-29 05:29:15,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 4176 transitions. [2023-11-29 05:29:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:29:15,347 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:15,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:15,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:29:15,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:15,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:15,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1109409757, now seen corresponding path program 1 times [2023-11-29 05:29:15,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676079358] [2023-11-29 05:29:15,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:29:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676079358] [2023-11-29 05:29:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676079358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:15,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:29:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159557879] [2023-11-29 05:29:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:15,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:29:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:15,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:29:15,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:29:15,632 INFO L87 Difference]: Start difference. First operand 2703 states and 4176 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:18,103 INFO L93 Difference]: Finished difference Result 2713 states and 4197 transitions. [2023-11-29 05:29:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:29:18,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-29 05:29:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:18,124 INFO L225 Difference]: With dead ends: 2713 [2023-11-29 05:29:18,124 INFO L226 Difference]: Without dead ends: 2710 [2023-11-29 05:29:18,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:29:18,127 INFO L413 NwaCegarLoop]: 1026 mSDtfsCounter, 1080 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:18,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1717 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 05:29:18,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2023-11-29 05:29:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2702. [2023-11-29 05:29:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 1955 states have (on average 1.489002557544757) internal successors, (2911), 1973 states have internal predecessors, (2911), 633 states have call successors, (633), 114 states have call predecessors, (633), 113 states have return successors, (630), 630 states have call predecessors, (630), 630 states have call successors, (630) [2023-11-29 05:29:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 4174 transitions. [2023-11-29 05:29:18,322 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 4174 transitions. Word has length 23 [2023-11-29 05:29:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:18,322 INFO L495 AbstractCegarLoop]: Abstraction has 2702 states and 4174 transitions. [2023-11-29 05:29:18,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 4174 transitions. [2023-11-29 05:29:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 05:29:18,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:18,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:29:18,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:29:18,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:18,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 31776704, now seen corresponding path program 1 times [2023-11-29 05:29:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297254905] [2023-11-29 05:29:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:29:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297254905] [2023-11-29 05:29:18,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297254905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:18,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:18,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:29:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012036151] [2023-11-29 05:29:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:29:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:18,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:29:18,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:29:18,620 INFO L87 Difference]: Start difference. First operand 2702 states and 4174 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:20,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:29:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:23,569 INFO L93 Difference]: Finished difference Result 8066 states and 12502 transitions. [2023-11-29 05:29:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:29:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-11-29 05:29:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:23,615 INFO L225 Difference]: With dead ends: 8066 [2023-11-29 05:29:23,616 INFO L226 Difference]: Without dead ends: 5357 [2023-11-29 05:29:23,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:29:23,630 INFO L413 NwaCegarLoop]: 1027 mSDtfsCounter, 1145 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:23,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 2605 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 05:29:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states. [2023-11-29 05:29:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 5332. [2023-11-29 05:29:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 3861 states have (on average 1.4897694897694898) internal successors, (5752), 3904 states have internal predecessors, (5752), 1257 states have call successors, (1257), 221 states have call predecessors, (1257), 213 states have return successors, (1247), 1238 states have call predecessors, (1247), 1247 states have call successors, (1247) [2023-11-29 05:29:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 8256 transitions. [2023-11-29 05:29:24,085 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 8256 transitions. Word has length 24 [2023-11-29 05:29:24,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:24,085 INFO L495 AbstractCegarLoop]: Abstraction has 5332 states and 8256 transitions. [2023-11-29 05:29:24,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:29:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 8256 transitions. [2023-11-29 05:29:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 05:29:24,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:24,091 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:29:24,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:29:24,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:24,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:24,092 INFO L85 PathProgramCache]: Analyzing trace with hash 87892329, now seen corresponding path program 1 times [2023-11-29 05:29:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927620861] [2023-11-29 05:29:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-29 05:29:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:29:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:29:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:29:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:29:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:24,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927620861] [2023-11-29 05:29:24,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927620861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:24,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:29:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39464613] [2023-11-29 05:29:24,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:24,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:29:24,560 INFO L87 Difference]: Start difference. First operand 5332 states and 8256 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:29:26,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:29:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:32,032 INFO L93 Difference]: Finished difference Result 10710 states and 16583 transitions. [2023-11-29 05:29:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:29:32,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2023-11-29 05:29:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:32,073 INFO L225 Difference]: With dead ends: 10710 [2023-11-29 05:29:32,073 INFO L226 Difference]: Without dead ends: 5375 [2023-11-29 05:29:32,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:29:32,095 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 261 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 3812 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:32,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 3812 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-29 05:29:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2023-11-29 05:29:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5334. [2023-11-29 05:29:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5334 states, 3863 states have (on average 1.4884804556044524) internal successors, (5750), 3906 states have internal predecessors, (5750), 1257 states have call successors, (1257), 221 states have call predecessors, (1257), 213 states have return successors, (1247), 1238 states have call predecessors, (1247), 1247 states have call successors, (1247) [2023-11-29 05:29:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 8254 transitions. [2023-11-29 05:29:32,508 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 8254 transitions. Word has length 61 [2023-11-29 05:29:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:32,509 INFO L495 AbstractCegarLoop]: Abstraction has 5334 states and 8254 transitions. [2023-11-29 05:29:32,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-29 05:29:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8254 transitions. [2023-11-29 05:29:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:29:32,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:32,514 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:29:32,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:29:32,514 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:32,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1071290908, now seen corresponding path program 1 times [2023-11-29 05:29:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374990864] [2023-11-29 05:29:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:29:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:29:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 05:29:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:29:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:29:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 05:29:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:29:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374990864] [2023-11-29 05:29:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374990864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:33,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:29:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011941968] [2023-11-29 05:29:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:33,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:29:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:29:33,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:29:33,139 INFO L87 Difference]: Start difference. First operand 5334 states and 8254 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:29:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:40,579 INFO L93 Difference]: Finished difference Result 11348 states and 17685 transitions. [2023-11-29 05:29:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:29:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2023-11-29 05:29:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:40,627 INFO L225 Difference]: With dead ends: 11348 [2023-11-29 05:29:40,627 INFO L226 Difference]: Without dead ends: 6015 [2023-11-29 05:29:40,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:29:40,652 INFO L413 NwaCegarLoop]: 994 mSDtfsCounter, 477 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 4738 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:40,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 4738 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-29 05:29:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2023-11-29 05:29:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5342. [2023-11-29 05:29:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5342 states, 3871 states have (on average 1.4874709377421855) internal successors, (5758), 3914 states have internal predecessors, (5758), 1257 states have call successors, (1257), 221 states have call predecessors, (1257), 213 states have return successors, (1247), 1238 states have call predecessors, (1247), 1247 states have call successors, (1247) [2023-11-29 05:29:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 8262 transitions. [2023-11-29 05:29:41,049 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 8262 transitions. Word has length 81 [2023-11-29 05:29:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:41,050 INFO L495 AbstractCegarLoop]: Abstraction has 5342 states and 8262 transitions. [2023-11-29 05:29:41,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:29:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 8262 transitions. [2023-11-29 05:29:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 05:29:41,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:41,056 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:29:41,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:29:41,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:41,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1979965746, now seen corresponding path program 1 times [2023-11-29 05:29:41,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209685205] [2023-11-29 05:29:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:29:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:29:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:29:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:29:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 05:29:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:29:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:29:41,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:41,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209685205] [2023-11-29 05:29:41,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209685205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:41,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:41,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:41,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921905950] [2023-11-29 05:29:41,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:41,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:41,540 INFO L87 Difference]: Start difference. First operand 5342 states and 8262 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:29:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:47,127 INFO L93 Difference]: Finished difference Result 10675 states and 16675 transitions. [2023-11-29 05:29:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:29:47,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2023-11-29 05:29:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:47,151 INFO L225 Difference]: With dead ends: 10675 [2023-11-29 05:29:47,151 INFO L226 Difference]: Without dead ends: 5334 [2023-11-29 05:29:47,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:29:47,173 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 1117 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:47,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 2255 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-29 05:29:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5334 states. [2023-11-29 05:29:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5334 to 5302. [2023-11-29 05:29:47,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 3847 states have (on average 1.4229269560696647) internal successors, (5474), 3890 states have internal predecessors, (5474), 1241 states have call successors, (1241), 221 states have call predecessors, (1241), 213 states have return successors, (1231), 1222 states have call predecessors, (1231), 1231 states have call successors, (1231) [2023-11-29 05:29:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 7946 transitions. [2023-11-29 05:29:47,439 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 7946 transitions. Word has length 83 [2023-11-29 05:29:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:47,439 INFO L495 AbstractCegarLoop]: Abstraction has 5302 states and 7946 transitions. [2023-11-29 05:29:47,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:29:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 7946 transitions. [2023-11-29 05:29:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 05:29:47,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:47,443 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:29:47,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:29:47,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:47,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1240301087, now seen corresponding path program 1 times [2023-11-29 05:29:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148511664] [2023-11-29 05:29:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:29:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:29:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:29:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:29:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:29:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:29:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 05:29:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:29:47,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:47,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148511664] [2023-11-29 05:29:47,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148511664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:47,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:47,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604953404] [2023-11-29 05:29:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:47,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:47,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:47,932 INFO L87 Difference]: Start difference. First operand 5302 states and 7946 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:29:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:29:54,988 INFO L93 Difference]: Finished difference Result 15942 states and 23910 transitions. [2023-11-29 05:29:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:29:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2023-11-29 05:29:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:29:55,028 INFO L225 Difference]: With dead ends: 15942 [2023-11-29 05:29:55,028 INFO L226 Difference]: Without dead ends: 10641 [2023-11-29 05:29:55,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:29:55,050 INFO L413 NwaCegarLoop]: 823 mSDtfsCounter, 1626 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 1162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1162 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:29:55,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 2631 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1162 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-29 05:29:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10641 states. [2023-11-29 05:29:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10641 to 10558. [2023-11-29 05:29:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10558 states, 7659 states have (on average 1.4226400313356835) internal successors, (10896), 7744 states have internal predecessors, (10896), 2473 states have call successors, (2473), 439 states have call predecessors, (2473), 425 states have return successors, (2457), 2438 states have call predecessors, (2457), 2457 states have call successors, (2457) [2023-11-29 05:29:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 15826 transitions. [2023-11-29 05:29:55,913 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 15826 transitions. Word has length 87 [2023-11-29 05:29:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:29:55,914 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 15826 transitions. [2023-11-29 05:29:55,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:29:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 15826 transitions. [2023-11-29 05:29:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 05:29:55,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:29:55,920 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 05:29:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:29:55,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:29:55,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:29:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2066641830, now seen corresponding path program 1 times [2023-11-29 05:29:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:29:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163110446] [2023-11-29 05:29:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:29:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:29:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:29:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:29:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:29:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:29:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:29:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:29:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 05:29:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 05:29:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:29:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:29:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 05:29:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:29:56,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163110446] [2023-11-29 05:29:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163110446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:29:56,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:29:56,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:29:56,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390918058] [2023-11-29 05:29:56,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:29:56,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:29:56,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:29:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:29:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:29:56,424 INFO L87 Difference]: Start difference. First operand 10558 states and 15826 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:30:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:30:04,291 INFO L93 Difference]: Finished difference Result 26460 states and 39765 transitions. [2023-11-29 05:30:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:30:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2023-11-29 05:30:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:30:04,376 INFO L225 Difference]: With dead ends: 26460 [2023-11-29 05:30:04,376 INFO L226 Difference]: Without dead ends: 15903 [2023-11-29 05:30:04,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:30:04,394 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 1206 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:30:04,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 3254 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-29 05:30:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15903 states. [2023-11-29 05:30:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15903 to 15794. [2023-11-29 05:30:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15794 states, 11517 states have (on average 1.415125466701398) internal successors, (16298), 11634 states have internal predecessors, (16298), 3655 states have call successors, (3655), 635 states have call predecessors, (3655), 621 states have return successors, (3639), 3620 states have call predecessors, (3639), 3639 states have call successors, (3639) [2023-11-29 05:30:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15794 states to 15794 states and 23592 transitions. [2023-11-29 05:30:05,267 INFO L78 Accepts]: Start accepts. Automaton has 15794 states and 23592 transitions. Word has length 89 [2023-11-29 05:30:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:30:05,267 INFO L495 AbstractCegarLoop]: Abstraction has 15794 states and 23592 transitions. [2023-11-29 05:30:05,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-29 05:30:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 15794 states and 23592 transitions. [2023-11-29 05:30:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:30:05,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:30:05,274 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:30:05,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:30:05,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:30:05,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:30:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1769058859, now seen corresponding path program 1 times [2023-11-29 05:30:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:30:05,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247253522] [2023-11-29 05:30:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:30:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:30:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:30:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:30:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:30:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:30:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:30:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:30:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 05:30:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 05:30:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:30:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247253522] [2023-11-29 05:30:05,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247253522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:30:05,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:30:05,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:30:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968581813] [2023-11-29 05:30:05,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:30:05,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:30:05,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:30:05,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:30:05,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:30:05,734 INFO L87 Difference]: Start difference. First operand 15794 states and 23592 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:30:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:30:16,244 INFO L93 Difference]: Finished difference Result 36964 states and 55353 transitions. [2023-11-29 05:30:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:30:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2023-11-29 05:30:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:30:16,370 INFO L225 Difference]: With dead ends: 36964 [2023-11-29 05:30:16,371 INFO L226 Difference]: Without dead ends: 21171 [2023-11-29 05:30:16,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:30:16,413 INFO L413 NwaCegarLoop]: 1437 mSDtfsCounter, 1058 mSDsluCounter, 3547 mSDsCounter, 0 mSdLazyCounter, 2939 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 4984 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:30:16,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 4984 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2939 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-11-29 05:30:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21171 states. [2023-11-29 05:30:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21171 to 21030. [2023-11-29 05:30:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21030 states, 15375 states have (on average 1.4113821138211382) internal successors, (21700), 15524 states have internal predecessors, (21700), 4837 states have call successors, (4837), 831 states have call predecessors, (4837), 817 states have return successors, (4821), 4802 states have call predecessors, (4821), 4821 states have call successors, (4821) [2023-11-29 05:30:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 31358 transitions. [2023-11-29 05:30:17,590 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 31358 transitions. Word has length 109 [2023-11-29 05:30:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:30:17,591 INFO L495 AbstractCegarLoop]: Abstraction has 21030 states and 31358 transitions. [2023-11-29 05:30:17,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-29 05:30:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 31358 transitions. [2023-11-29 05:30:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 05:30:17,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:30:17,605 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:30:17,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:30:17,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:30:17,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:30:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1119766478, now seen corresponding path program 1 times [2023-11-29 05:30:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:30:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578907682] [2023-11-29 05:30:17,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:30:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:30:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:30:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:30:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:30:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:30:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 05:30:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:30:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:30:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 05:30:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 05:30:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:30:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578907682] [2023-11-29 05:30:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578907682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:30:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440323665] [2023-11-29 05:30:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:30:18,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:30:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:30:18,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:30:18,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:30:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:19,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:30:19,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:30:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-29 05:30:19,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:30:19,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440323665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:30:19,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:30:19,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-29 05:30:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119885872] [2023-11-29 05:30:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:30:19,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:30:19,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:30:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:30:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:30:19,239 INFO L87 Difference]: Start difference. First operand 21030 states and 31358 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:30:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:30:20,731 INFO L93 Difference]: Finished difference Result 42087 states and 62746 transitions. [2023-11-29 05:30:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:30:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2023-11-29 05:30:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:30:20,877 INFO L225 Difference]: With dead ends: 42087 [2023-11-29 05:30:20,878 INFO L226 Difference]: Without dead ends: 21042 [2023-11-29 05:30:20,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:30:20,912 INFO L413 NwaCegarLoop]: 1081 mSDtfsCounter, 22 mSDsluCounter, 4283 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5364 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:30:20,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5364 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:30:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21042 states. [2023-11-29 05:30:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21042 to 21008. [2023-11-29 05:30:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21008 states, 15353 states have (on average 1.4111899954406304) internal successors, (21666), 15506 states have internal predecessors, (21666), 4837 states have call successors, (4837), 831 states have call predecessors, (4837), 817 states have return successors, (4821), 4798 states have call predecessors, (4821), 4821 states have call successors, (4821) [2023-11-29 05:30:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21008 states to 21008 states and 31324 transitions. [2023-11-29 05:30:22,014 INFO L78 Accepts]: Start accepts. Automaton has 21008 states and 31324 transitions. Word has length 126 [2023-11-29 05:30:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:30:22,015 INFO L495 AbstractCegarLoop]: Abstraction has 21008 states and 31324 transitions. [2023-11-29 05:30:22,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:30:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 21008 states and 31324 transitions. [2023-11-29 05:30:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 05:30:22,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:30:22,028 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:30:22,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 05:30:22,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 05:30:22,229 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:30:22,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:30:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1970215007, now seen corresponding path program 1 times [2023-11-29 05:30:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:30:22,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462852038] [2023-11-29 05:30:22,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:30:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:30:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:30:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:30:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:30:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:30:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:30:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 05:30:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:30:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 05:30:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:30:22,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:30:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462852038] [2023-11-29 05:30:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462852038] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:30:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673426427] [2023-11-29 05:30:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:30:22,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:30:22,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:30:22,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:30:22,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:30:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:23,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 3347 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:30:23,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:30:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 05:30:24,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:30:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673426427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:30:24,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:30:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-29 05:30:24,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268887967] [2023-11-29 05:30:24,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:30:24,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:30:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:30:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:30:24,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:30:24,062 INFO L87 Difference]: Start difference. First operand 21008 states and 31324 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 05:30:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:30:27,081 INFO L93 Difference]: Finished difference Result 63025 states and 93972 transitions. [2023-11-29 05:30:27,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:30:27,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 133 [2023-11-29 05:30:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:30:27,301 INFO L225 Difference]: With dead ends: 63025 [2023-11-29 05:30:27,301 INFO L226 Difference]: Without dead ends: 63014 [2023-11-29 05:30:27,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:30:27,325 INFO L413 NwaCegarLoop]: 2040 mSDtfsCounter, 2240 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 3829 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:30:27,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 3829 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 05:30:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63014 states. [2023-11-29 05:30:30,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63014 to 62976. [2023-11-29 05:30:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62976 states, 46025 states have (on average 1.4112764801738187) internal successors, (64954), 46482 states have internal predecessors, (64954), 14501 states have call successors, (14501), 2487 states have call predecessors, (14501), 2449 states have return successors, (14461), 14390 states have call predecessors, (14461), 14461 states have call successors, (14461) [2023-11-29 05:30:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62976 states to 62976 states and 93916 transitions. [2023-11-29 05:30:31,033 INFO L78 Accepts]: Start accepts. Automaton has 62976 states and 93916 transitions. Word has length 133 [2023-11-29 05:30:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:30:31,033 INFO L495 AbstractCegarLoop]: Abstraction has 62976 states and 93916 transitions. [2023-11-29 05:30:31,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 05:30:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 62976 states and 93916 transitions. [2023-11-29 05:30:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-29 05:30:31,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:30:31,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:30:31,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:30:31,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd4affde-cc98-4161-a65c-7d1e1801a5c1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 05:30:31,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:30:31,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:30:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash -410472770, now seen corresponding path program 1 times [2023-11-29 05:30:31,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:30:31,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919374773] [2023-11-29 05:30:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:30:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:30:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:30:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:30:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:30:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:30:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:30:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 05:30:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:30:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:30:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:30:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 05:30:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:30:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:30:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:30:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919374773] [2023-11-29 05:30:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919374773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:30:31,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:30:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:30:31,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133859803] [2023-11-29 05:30:31,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:30:31,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:30:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:30:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:30:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:30:31,694 INFO L87 Difference]: Start difference. First operand 62976 states and 93916 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:30:32,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:35,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:37,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:43,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:47,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:51,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:55,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:30:56,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:01,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:05,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:07,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:09,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:13,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:17,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:20,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:21,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:23,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:28,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:32,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:34,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:38,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:43,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:47,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:51,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:55,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:31:59,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:03,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:07,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:10,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:17,492 INFO L93 Difference]: Finished difference Result 142136 states and 212458 transitions. [2023-11-29 05:32:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:32:17,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2023-11-29 05:32:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:17,895 INFO L225 Difference]: With dead ends: 142136 [2023-11-29 05:32:17,895 INFO L226 Difference]: Without dead ends: 79161 [2023-11-29 05:32:18,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:32:18,008 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 1672 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 5553 mSolverCounterSat, 868 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 6438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 5553 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 102.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:18,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 1510 Invalid, 6438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 5553 Invalid, 17 Unknown, 0 Unchecked, 102.1s Time] [2023-11-29 05:32:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79161 states. [2023-11-29 05:32:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79161 to 78666. [2023-11-29 05:32:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78666 states, 57581 states have (on average 1.4089890762577935) internal successors, (81131), 58137 states have internal predecessors, (81131), 18047 states have call successors, (18047), 3075 states have call predecessors, (18047), 3037 states have return successors, (18007), 17933 states have call predecessors, (18007), 18007 states have call successors, (18007) [2023-11-29 05:32:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78666 states to 78666 states and 117185 transitions. [2023-11-29 05:32:22,436 INFO L78 Accepts]: Start accepts. Automaton has 78666 states and 117185 transitions. Word has length 138 [2023-11-29 05:32:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:22,437 INFO L495 AbstractCegarLoop]: Abstraction has 78666 states and 117185 transitions. [2023-11-29 05:32:22,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:32:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 78666 states and 117185 transitions. [2023-11-29 05:32:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-29 05:32:22,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:22,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:32:22,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:32:22,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:22,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash -191618052, now seen corresponding path program 1 times [2023-11-29 05:32:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370965275] [2023-11-29 05:32:22,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:32:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:32:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:32:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:32:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 05:32:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:32:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 05:32:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:32:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370965275] [2023-11-29 05:32:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370965275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:22,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:22,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:32:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203312497] [2023-11-29 05:32:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:22,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:32:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:32:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:32:22,970 INFO L87 Difference]: Start difference. First operand 78666 states and 117185 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:32:32,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:36,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:40,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:44,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:48,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:52,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:32:57,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:01,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:05,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:09,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:13,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:17,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:21,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:25,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:27,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:31,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:35,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:39,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:33:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:46,111 INFO L93 Difference]: Finished difference Result 157811 states and 235209 transitions. [2023-11-29 05:33:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:33:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2023-11-29 05:33:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:46,487 INFO L225 Difference]: With dead ends: 157811 [2023-11-29 05:33:46,487 INFO L226 Difference]: Without dead ends: 79146 [2023-11-29 05:33:46,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:33:46,632 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 1687 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 4160 mSolverCounterSat, 1036 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 78.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 5210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 4160 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:46,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 1254 Invalid, 5210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 4160 Invalid, 14 Unknown, 0 Unchecked, 79.1s Time] [2023-11-29 05:33:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79146 states. [2023-11-29 05:33:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79146 to 78666. [2023-11-29 05:33:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78666 states, 57581 states have (on average 1.4087806741807194) internal successors, (81119), 58137 states have internal predecessors, (81119), 18047 states have call successors, (18047), 3075 states have call predecessors, (18047), 3037 states have return successors, (18007), 17933 states have call predecessors, (18007), 18007 states have call successors, (18007) [2023-11-29 05:33:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78666 states to 78666 states and 117173 transitions. [2023-11-29 05:33:51,762 INFO L78 Accepts]: Start accepts. Automaton has 78666 states and 117173 transitions. Word has length 138 [2023-11-29 05:33:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:51,763 INFO L495 AbstractCegarLoop]: Abstraction has 78666 states and 117173 transitions. [2023-11-29 05:33:51,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:33:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 78666 states and 117173 transitions. [2023-11-29 05:33:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-29 05:33:51,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:51,793 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:33:51,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:33:51,794 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:51,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash -218872736, now seen corresponding path program 1 times [2023-11-29 05:33:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286290012] [2023-11-29 05:33:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:33:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:33:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:33:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:33:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:33:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:33:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:33:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 05:33:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:52,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286290012] [2023-11-29 05:33:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286290012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:33:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647564973] [2023-11-29 05:33:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:52,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:33:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:33:52,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:33:52,316 INFO L87 Difference]: Start difference. First operand 78666 states and 117173 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:34:01,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:05,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:09,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:13,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:17,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:22,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:26,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:30,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:34,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:38,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:42,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:46,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:50,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:54,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:34:58,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:03,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:07,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:11,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:15,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:21,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:25,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:29,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:33,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:37,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:39,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:43,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:35:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:51,364 INFO L93 Difference]: Finished difference Result 173612 states and 259140 transitions. [2023-11-29 05:35:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:35:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2023-11-29 05:35:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:51,893 INFO L225 Difference]: With dead ends: 173612 [2023-11-29 05:35:51,893 INFO L226 Difference]: Without dead ends: 94947 [2023-11-29 05:35:52,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:35:52,042 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 1754 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 5139 mSolverCounterSat, 1060 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 6223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1060 IncrementalHoareTripleChecker+Valid, 5139 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:52,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 1487 Invalid, 6223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1060 Valid, 5139 Invalid, 24 Unknown, 0 Unchecked, 114.2s Time] [2023-11-29 05:35:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94947 states. [2023-11-29 05:35:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94947 to 94356. [2023-11-29 05:35:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94356 states, 69137 states have (on average 1.4072927665360082) internal successors, (97296), 69792 states have internal predecessors, (97296), 21593 states have call successors, (21593), 3663 states have call predecessors, (21593), 3625 states have return successors, (21553), 21476 states have call predecessors, (21553), 21553 states have call successors, (21553) [2023-11-29 05:35:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94356 states to 94356 states and 140442 transitions. [2023-11-29 05:35:57,816 INFO L78 Accepts]: Start accepts. Automaton has 94356 states and 140442 transitions. Word has length 135 [2023-11-29 05:35:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:57,816 INFO L495 AbstractCegarLoop]: Abstraction has 94356 states and 140442 transitions. [2023-11-29 05:35:57,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:35:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 94356 states and 140442 transitions. [2023-11-29 05:35:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 05:35:57,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:57,848 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:35:57,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:35:57,848 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:35:57,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1381712015, now seen corresponding path program 1 times [2023-11-29 05:35:57,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:57,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191181911] [2023-11-29 05:35:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:35:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:35:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:35:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:35:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:35:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:35:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:35:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 05:35:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:35:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:35:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 05:35:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-29 05:35:58,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191181911] [2023-11-29 05:35:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191181911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:58,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:35:58,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:35:58,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695855397] [2023-11-29 05:35:58,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:58,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:35:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:58,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:35:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:35:58,253 INFO L87 Difference]: Start difference. First operand 94356 states and 140442 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:36:06,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:10,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:13,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:17,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:19,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:21,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:26,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:30,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:34,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:37,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:39,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:43,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:47,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:51,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:55,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:36:59,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:03,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:07,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:37:16,170 INFO L93 Difference]: Finished difference Result 189287 states and 281891 transitions. [2023-11-29 05:37:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:37:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2023-11-29 05:37:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:37:16,520 INFO L225 Difference]: With dead ends: 189287 [2023-11-29 05:37:16,521 INFO L226 Difference]: Without dead ends: 94932 [2023-11-29 05:37:16,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:37:16,711 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 1611 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 4660 mSolverCounterSat, 852 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 5523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 852 IncrementalHoareTripleChecker+Valid, 4660 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:37:16,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 1432 Invalid, 5523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [852 Valid, 4660 Invalid, 11 Unknown, 0 Unchecked, 72.7s Time] [2023-11-29 05:37:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94932 states. [2023-11-29 05:37:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94932 to 94356. [2023-11-29 05:37:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94356 states, 69137 states have (on average 1.4071191981138897) internal successors, (97284), 69792 states have internal predecessors, (97284), 21593 states have call successors, (21593), 3663 states have call predecessors, (21593), 3625 states have return successors, (21553), 21476 states have call predecessors, (21553), 21553 states have call successors, (21553) [2023-11-29 05:37:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94356 states to 94356 states and 140430 transitions. [2023-11-29 05:37:22,854 INFO L78 Accepts]: Start accepts. Automaton has 94356 states and 140430 transitions. Word has length 136 [2023-11-29 05:37:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:37:22,854 INFO L495 AbstractCegarLoop]: Abstraction has 94356 states and 140430 transitions. [2023-11-29 05:37:22,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:37:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 94356 states and 140430 transitions. [2023-11-29 05:37:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 05:37:22,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:37:22,871 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:37:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:37:22,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:37:22,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:37:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1110569750, now seen corresponding path program 1 times [2023-11-29 05:37:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:37:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730213485] [2023-11-29 05:37:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:37:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:37:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:37:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:37:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:37:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:37:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:37:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:37:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:37:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:37:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:37:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:37:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:37:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:37:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:37:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:37:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:37:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 05:37:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:37:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-29 05:37:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:37:23,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730213485] [2023-11-29 05:37:23,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730213485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:37:23,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:37:23,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:37:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195856151] [2023-11-29 05:37:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:37:23,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:37:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:37:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:37:23,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:37:23,233 INFO L87 Difference]: Start difference. First operand 94356 states and 140430 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:37:32,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:36,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:40,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:44,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:48,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:52,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:54,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:37:58,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:00,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:03,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:07,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:11,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:13,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:17,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:22,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:26,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:29,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:31,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:36,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:40,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:44,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:46,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:50,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:53,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:38:57,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:06,987 INFO L93 Difference]: Finished difference Result 205088 states and 305822 transitions. [2023-11-29 05:39:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:39:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2023-11-29 05:39:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:07,510 INFO L225 Difference]: With dead ends: 205088 [2023-11-29 05:39:07,510 INFO L226 Difference]: Without dead ends: 110733 [2023-11-29 05:39:07,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:39:07,795 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 1674 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 5167 mSolverCounterSat, 868 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1780 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 6049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 5167 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 97.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:07,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1780 Valid, 1516 Invalid, 6049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 5167 Invalid, 14 Unknown, 0 Unchecked, 97.2s Time] [2023-11-29 05:39:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110733 states. [2023-11-29 05:39:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110733 to 110046. [2023-11-29 05:39:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110046 states, 80693 states have (on average 1.4060823119725379) internal successors, (113461), 81447 states have internal predecessors, (113461), 25139 states have call successors, (25139), 4251 states have call predecessors, (25139), 4213 states have return successors, (25099), 25019 states have call predecessors, (25099), 25099 states have call successors, (25099) [2023-11-29 05:39:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110046 states to 110046 states and 163699 transitions. [2023-11-29 05:39:14,509 INFO L78 Accepts]: Start accepts. Automaton has 110046 states and 163699 transitions. Word has length 137 [2023-11-29 05:39:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:14,509 INFO L495 AbstractCegarLoop]: Abstraction has 110046 states and 163699 transitions. [2023-11-29 05:39:14,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:39:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 110046 states and 163699 transitions. [2023-11-29 05:39:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 05:39:14,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:14,523 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:39:14,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:39:14,524 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:39:14,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash -562243927, now seen corresponding path program 1 times [2023-11-29 05:39:14,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:39:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839298277] [2023-11-29 05:39:14,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:14,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:39:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:39:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 05:39:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:39:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:39:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:39:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:39:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:39:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 05:39:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:39:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:39:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:39:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 05:39:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-29 05:39:15,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:39:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839298277] [2023-11-29 05:39:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839298277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:39:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:39:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:39:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410040914] [2023-11-29 05:39:15,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:39:15,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:39:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:39:15,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:39:15,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:39:15,005 INFO L87 Difference]: Start difference. First operand 110046 states and 163699 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:39:16,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:23,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:27,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:31,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:34,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:37,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:42,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:46,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:50,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:54,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:39:58,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:02,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:04,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:08,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:12,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:16,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:26,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:26,526 INFO L93 Difference]: Finished difference Result 220763 states and 328573 transitions. [2023-11-29 05:40:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:40:26,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2023-11-29 05:40:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:26,933 INFO L225 Difference]: With dead ends: 220763 [2023-11-29 05:40:26,933 INFO L226 Difference]: Without dead ends: 110718 [2023-11-29 05:40:27,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:40:27,256 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 1760 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 3968 mSolverCounterSat, 1220 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 5198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1220 IncrementalHoareTripleChecker+Valid, 3968 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:27,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 1242 Invalid, 5198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1220 Valid, 3968 Invalid, 10 Unknown, 0 Unchecked, 64.5s Time] [2023-11-29 05:40:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110718 states. [2023-11-29 05:40:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110718 to 110046. [2023-11-29 05:40:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110046 states, 80693 states have (on average 1.4059336001883682) internal successors, (113449), 81447 states have internal predecessors, (113449), 25139 states have call successors, (25139), 4251 states have call predecessors, (25139), 4213 states have return successors, (25099), 25019 states have call predecessors, (25099), 25099 states have call successors, (25099) [2023-11-29 05:40:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110046 states to 110046 states and 163687 transitions. [2023-11-29 05:40:35,159 INFO L78 Accepts]: Start accepts. Automaton has 110046 states and 163687 transitions. Word has length 136 [2023-11-29 05:40:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:35,159 INFO L495 AbstractCegarLoop]: Abstraction has 110046 states and 163687 transitions. [2023-11-29 05:40:35,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 05:40:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 110046 states and 163687 transitions. [2023-11-29 05:40:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 05:40:35,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:35,182 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:40:35,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:40:35,182 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:40:35,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash 903557057, now seen corresponding path program 1 times [2023-11-29 05:40:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:40:35,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608552178] [2023-11-29 05:40:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:35,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:40:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:40:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:40:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 05:40:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:40:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:40:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 05:40:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:40:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 05:40:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:40:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:40:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:40:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 05:40:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-29 05:40:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:40:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608552178] [2023-11-29 05:40:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608552178] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:40:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:40:35,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:40:35,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156507758] [2023-11-29 05:40:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:40:35,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:40:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:40:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:40:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:40:35,799 INFO L87 Difference]: Start difference. First operand 110046 states and 163687 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 05:40:38,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:41,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:46,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:47,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:51,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:40:56,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:00,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:04,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:08,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:12,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:16,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:20,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:24,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:29,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:33,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:37,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:41,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:45,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:50,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:54,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:41:58,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:02,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:06,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:42:11,203 INFO L93 Difference]: Finished difference Result 167097 states and 248857 transitions. [2023-11-29 05:42:11,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:42:11,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 142 [2023-11-29 05:42:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:42:11,413 INFO L225 Difference]: With dead ends: 167097 [2023-11-29 05:42:11,414 INFO L226 Difference]: Without dead ends: 53512 [2023-11-29 05:42:11,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:42:11,741 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 2375 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 3101 mSolverCounterSat, 1426 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2470 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1426 IncrementalHoareTripleChecker+Valid, 3101 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:42:11,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2470 Valid, 1044 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1426 Valid, 3101 Invalid, 17 Unknown, 0 Unchecked, 90.9s Time] [2023-11-29 05:42:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53512 states. [2023-11-29 05:42:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53512 to 28508. [2023-11-29 05:42:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28508 states, 20920 states have (on average 1.4069789674952198) internal successors, (29434), 21119 states have internal predecessors, (29434), 6509 states have call successors, (6509), 1089 states have call predecessors, (6509), 1078 states have return successors, (6496), 6479 states have call predecessors, (6496), 6496 states have call successors, (6496) [2023-11-29 05:42:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28508 states to 28508 states and 42439 transitions. [2023-11-29 05:42:14,285 INFO L78 Accepts]: Start accepts. Automaton has 28508 states and 42439 transitions. Word has length 142 [2023-11-29 05:42:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:42:14,285 INFO L495 AbstractCegarLoop]: Abstraction has 28508 states and 42439 transitions. [2023-11-29 05:42:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-29 05:42:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 28508 states and 42439 transitions. [2023-11-29 05:42:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 05:42:14,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:42:14,298 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:42:14,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:42:14,298 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:42:14,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:42:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -793683889, now seen corresponding path program 1 times [2023-11-29 05:42:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:42:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419922884] [2023-11-29 05:42:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:42:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:42:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:42:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:42:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:42:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 05:42:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:42:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:42:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:42:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:42:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 05:42:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:42:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:42:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 05:42:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:42:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 05:42:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:42:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419922884] [2023-11-29 05:42:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419922884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:42:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:42:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:42:14,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962385477] [2023-11-29 05:42:14,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:42:14,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:42:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:42:14,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:42:14,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:42:14,514 INFO L87 Difference]: Start difference. First operand 28508 states and 42439 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 05:42:21,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:24,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:28,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:32,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:42:34,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []