./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c9ee75e44352b6ea6b091abc908af4681506ed391b6529699b0d4480d6bf973b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:36:10,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:36:10,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 11:36:10,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:36:10,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:36:10,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:36:10,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:36:10,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:36:10,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:36:10,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:36:10,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:36:10,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:36:10,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:36:10,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:36:10,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:36:10,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:36:10,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:36:10,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:36:10,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:36:10,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:36:10,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:36:10,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:36:10,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:36:10,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:36:10,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:36:10,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> c9ee75e44352b6ea6b091abc908af4681506ed391b6529699b0d4480d6bf973b [2025-03-04 11:36:10,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:36:10,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:36:10,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:36:10,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:36:10,999 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:36:11,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i [2025-03-04 11:36:12,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fe94b36/2b25ad1703514e658cec741b7a95c43b/FLAG00ec41984 [2025-03-04 11:36:12,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:36:12,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i [2025-03-04 11:36:12,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fe94b36/2b25ad1703514e658cec741b7a95c43b/FLAG00ec41984 [2025-03-04 11:36:12,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3fe94b36/2b25ad1703514e658cec741b7a95c43b [2025-03-04 11:36:12,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:36:12,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:36:12,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:36:12,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:36:12,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:36:12,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb13be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:12, skipping insertion in model container [2025-03-04 11:36:12,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:36:12" (1/1) ... [2025-03-04 11:36:12,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:36:13,017 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2550] [2025-03-04 11:36:13,018 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2551-2552] [2025-03-04 11:36:13,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:36:13,367 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:36:13,417 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2550] [2025-03-04 11:36:13,417 WARN L1383 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2551-2552] [2025-03-04 11:36:13,420 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [2634] [2025-03-04 11:36:13,421 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("661:\n\tcall __sw_hweight32\n662:\n.pushsection .altinstructions,\"a\"\n .long 661b - .\n .long 6631f - .\n .word (4*32+23)\n .byte 662b-661b\n .byte 6641f-6631f\n.popsection\n.pushsection .discard,\"aw\",@progbits\n .byte 0xff + (6641f-6631f) - (662b-661b)\n.popsection\n.pushsection .altinstr_replacement, \"ax\"\n6631:\n\t.byte 0xf3,0x40,0x0f,0xb8,0xc7\n6641:\n\t.popsection": "=a" (res): "D" (w)); [2643] [2025-03-04 11:36:13,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (179), "i" (12UL)); [2687-2688] [2025-03-04 11:36:13,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c6;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c5\n .byte 772b-771b\n .short %c7\n.popsection\n": "=D" (__edi), "=S" (__esi), "=d" (__edx), "=c" (__ecx), "=a" (__eax): [paravirt_typenum] "i" (34UL), [paravirt_opptr] "i" (& pv_cpu_ops.read_tsc), [paravirt_clobber] "i" (511): "memory", "cc", "r8", "r9", "r10", "r11"); [2693-2696] [2025-03-04 11:36:13,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (804), "i" (12UL)); [2719-2720] [2025-03-04 11:36:13,429 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [2725-2727] [2025-03-04 11:36:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (809), "i" (12UL)); [2749-2750] [2025-03-04 11:36:13,431 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (45UL), [paravirt_opptr] "i" (& pv_irq_ops.restore_fl.func), [paravirt_clobber] "i" (1), "D" (f): "memory", "cc"); [2755-2757] [2025-03-04 11:36:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"./arch/x86/include/asm/paravirt.h"), "i" (814), "i" (12UL)); [2778-2779] [2025-03-04 11:36:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (46UL), [paravirt_opptr] "i" (& pv_irq_ops.irq_disable.func), [paravirt_clobber] "i" (1): "memory", "cc"); [2784-2786] [2025-03-04 11:36:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [2810] [2025-03-04 11:36:13,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [2818] [2025-03-04 11:36:13,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:36:13,580 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:36:13,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13 WrapperNode [2025-03-04 11:36:13,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:36:13,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:36:13,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:36:13,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:36:13,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,694 INFO L138 Inliner]: procedures = 120, calls = 710, calls flagged for inlining = 41, calls inlined = 39, statements flattened = 2504 [2025-03-04 11:36:13,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:36:13,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:36:13,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:36:13,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:36:13,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,805 INFO L175 MemorySlicer]: Split 482 memory accesses to 19 slices as follows [252, 2, 28, 22, 2, 3, 51, 1, 18, 3, 1, 7, 21, 23, 6, 9, 9, 5, 19]. 52 percent of accesses are in the largest equivalence class. The 134 initializations are split as follows [7, 2, 0, 0, 0, 0, 51, 0, 18, 0, 0, 7, 16, 16, 4, 6, 4, 3, 0]. The 145 writes are split as follows [75, 0, 24, 22, 1, 0, 0, 0, 0, 1, 0, 0, 0, 5, 0, 0, 0, 0, 17]. [2025-03-04 11:36:13,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:36:13,942 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:36:13,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:36:13,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:36:13,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (1/1) ... [2025-03-04 11:36:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:36:13,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:13,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:36:13,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_trigger [2025-03-04 11:36:13,993 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_trigger [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-03-04 11:36:13,993 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_disable [2025-03-04 11:36:13,993 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_disable [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 11:36:13,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2025-03-04 11:36:13,994 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight16 [2025-03-04 11:36:13,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight16 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 11:36:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 11:36:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 11:36:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 11:36:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 11:36:13,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 11:36:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:36:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:36:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:36:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:36:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:36:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:36:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_get_drvdata [2025-03-04 11:36:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_get_drvdata [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_read [2025-03-04 11:36:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_read [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 11:36:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2025-03-04 11:36:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_open [2025-03-04 11:36:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_open [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_on [2025-03-04 11:36:13,998 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_on [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:36:13,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_restore [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_restore [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight32 [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight32 [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_irq_save [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_irq_save [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:36:13,999 INFO L130 BoogieDeclarations]: Found specification of procedure analog_poll [2025-03-04 11:36:13,999 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_poll [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-04 11:36:14,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 11:36:14,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 11:36:14,001 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-03-04 11:36:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-03-04 11:36:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 11:36:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure trace_hardirqs_off [2025-03-04 11:36:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure trace_hardirqs_off [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_set_drvdata [2025-03-04 11:36:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_set_drvdata [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 11:36:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 11:36:14,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure analog_decode [2025-03-04 11:36:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_decode [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2025-03-04 11:36:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_hweight8 [2025-03-04 11:36:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_hweight8 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure analog_button_read [2025-03-04 11:36:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_button_read [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-03-04 11:36:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2025-03-04 11:36:14,004 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 11:36:14,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_close [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_close [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_time [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_time [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure analog_disconnect [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_disconnect [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 11:36:14,005 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 11:36:14,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure gameport_cooked_read [2025-03-04 11:36:14,006 INFO L138 BoogieDeclarations]: Found implementation of procedure gameport_cooked_read [2025-03-04 11:36:14,006 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-03-04 11:36:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-03-04 11:36:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure paravirt_read_tsc [2025-03-04 11:36:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure paravirt_read_tsc [2025-03-04 11:36:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 11:36:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 11:36:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:36:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:36:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure analog_cooked_read [2025-03-04 11:36:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure analog_cooked_read [2025-03-04 11:36:14,007 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2025-03-04 11:36:14,007 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2025-03-04 11:36:14,333 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:36:14,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:36:14,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 11:36:14,396 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4393: havoc #t~nondet473; [2025-03-04 11:36:14,403 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4333: havoc #t~nondet465; [2025-03-04 11:36:14,785 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802: havoc #t~bitwise25; [2025-03-04 11:36:14,860 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4385: havoc #t~nondet471; [2025-03-04 11:36:14,891 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: havoc #t~mem38.base, #t~mem38.offset; [2025-03-04 11:36:15,046 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3054: havoc #t~mem89; [2025-03-04 11:36:20,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3817: havoc analog_init_masks_#t~mem383#1;havoc analog_init_masks_#t~mem384#1;havoc analog_init_masks_#t~short385#1;call ULTIMATE.dealloc(analog_init_masks_~#max~0#1.base, analog_init_masks_~#max~0#1.offset);havoc analog_init_masks_~#max~0#1.base, analog_init_masks_~#max~0#1.offset; [2025-03-04 11:36:20,053 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4352: havoc input_register_device_#t~nondet466#1; [2025-03-04 11:36:20,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc ldv_bind_1_#t~nondet468#1; [2025-03-04 11:36:20,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4375: havoc ldv_release_1_#t~nondet469#1; [2025-03-04 11:36:20,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4048: call ULTIMATE.dealloc(analog_parse_options_~#end~0#1.base, analog_parse_options_~#end~0#1.offset);havoc analog_parse_options_~#end~0#1.base, analog_parse_options_~#end~0#1.offset; [2025-03-04 11:36:20,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: havoc input_allocate_device_#t~ret39#1.base, input_allocate_device_#t~ret39#1.offset; [2025-03-04 11:36:20,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc __gameport_register_driver_#t~nondet464#1; [2025-03-04 11:36:20,055 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: havoc simple_strtoul_#t~nondet472#1; [2025-03-04 11:36:20,542 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3307: havoc #t~mem164;call ULTIMATE.dealloc(~#time~0.base, ~#time~0.offset);havoc ~#time~0.base, ~#time~0.offset;call ULTIMATE.dealloc(~#data~0.base, ~#data~0.offset);havoc ~#data~0.base, ~#data~0.offset; [2025-03-04 11:36:20,829 INFO L? ?]: Removed 1065 outVars from TransFormulas that were not future-live. [2025-03-04 11:36:20,830 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:36:20,909 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:36:20,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:36:20,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:36:20 BoogieIcfgContainer [2025-03-04 11:36:20,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:36:20,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:36:20,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:36:20,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:36:20,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:36:12" (1/3) ... [2025-03-04 11:36:20,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d436686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:36:20, skipping insertion in model container [2025-03-04 11:36:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:36:13" (2/3) ... [2025-03-04 11:36:20,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d436686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:36:20, skipping insertion in model container [2025-03-04 11:36:20,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:36:20" (3/3) ... [2025-03-04 11:36:20,921 INFO L128 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i [2025-03-04 11:36:20,934 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:36:20,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--joystick--analog.ko-entry_point.cil.out.i that has 46 procedures, 1381 locations, 1 initial locations, 3 loop locations, and 235 error locations. [2025-03-04 11:36:20,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:36:21,010 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@174f0644, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:36:21,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 235 error locations. [2025-03-04 11:36:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 1380 states, 962 states have (on average 1.5717255717255718) internal successors, (1512), 1213 states have internal predecessors, (1512), 138 states have call successors, (138), 45 states have call predecessors, (138), 44 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 11:36:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 11:36:21,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:21,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:21,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:21,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1419073790, now seen corresponding path program 1 times [2025-03-04 11:36:21,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:21,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122663896] [2025-03-04 11:36:21,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:21,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:21,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 11:36:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 11:36:21,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:21,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122663896] [2025-03-04 11:36:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122663896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053606075] [2025-03-04 11:36:21,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:21,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:21,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:21,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:21,959 INFO L87 Difference]: Start difference. First operand has 1380 states, 962 states have (on average 1.5717255717255718) internal successors, (1512), 1213 states have internal predecessors, (1512), 138 states have call successors, (138), 45 states have call predecessors, (138), 44 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:22,976 INFO L93 Difference]: Finished difference Result 2799 states and 3665 transitions. [2025-03-04 11:36:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:22,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-04 11:36:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:22,993 INFO L225 Difference]: With dead ends: 2799 [2025-03-04 11:36:22,993 INFO L226 Difference]: Without dead ends: 1394 [2025-03-04 11:36:23,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:23,002 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 88 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:23,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 3280 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:36:23,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-04 11:36:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1388. [2025-03-04 11:36:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 994 states have (on average 1.5301810865191148) internal successors, (1521), 1216 states have internal predecessors, (1521), 135 states have call successors, (135), 46 states have call predecessors, (135), 46 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 11:36:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1791 transitions. [2025-03-04 11:36:23,095 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1791 transitions. Word has length 18 [2025-03-04 11:36:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:23,095 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1791 transitions. [2025-03-04 11:36:23,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1791 transitions. [2025-03-04 11:36:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 11:36:23,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:23,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:23,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:36:23,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:23,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash 376917218, now seen corresponding path program 1 times [2025-03-04 11:36:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482446227] [2025-03-04 11:36:23,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:23,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 11:36:23,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 11:36:23,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482446227] [2025-03-04 11:36:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482446227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556933975] [2025-03-04 11:36:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:23,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:23,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:23,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:23,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:23,822 INFO L87 Difference]: Start difference. First operand 1388 states and 1791 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:24,751 INFO L93 Difference]: Finished difference Result 2806 states and 3637 transitions. [2025-03-04 11:36:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-04 11:36:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:24,760 INFO L225 Difference]: With dead ends: 2806 [2025-03-04 11:36:24,760 INFO L226 Difference]: Without dead ends: 1434 [2025-03-04 11:36:24,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:24,765 INFO L435 NwaCegarLoop]: 1611 mSDtfsCounter, 24 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:24,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3215 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:36:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2025-03-04 11:36:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2025-03-04 11:36:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1036 states have (on average 1.524131274131274) internal successors, (1579), 1258 states have internal predecessors, (1579), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 11:36:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1853 transitions. [2025-03-04 11:36:24,814 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1853 transitions. Word has length 20 [2025-03-04 11:36:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:24,814 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1853 transitions. [2025-03-04 11:36:24,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1853 transitions. [2025-03-04 11:36:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 11:36:24,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:24,815 INFO L218 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] [2025-03-04 11:36:24,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:36:24,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:24,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2052052256, now seen corresponding path program 1 times [2025-03-04 11:36:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604941061] [2025-03-04 11:36:24,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:25,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 11:36:25,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 11:36:25,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:25,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:25,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604941061] [2025-03-04 11:36:25,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604941061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:25,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:25,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:25,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537803215] [2025-03-04 11:36:25,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:25,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:25,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:25,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:25,371 INFO L87 Difference]: Start difference. First operand 1432 states and 1853 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:26,210 INFO L93 Difference]: Finished difference Result 1462 states and 1897 transitions. [2025-03-04 11:36:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-04 11:36:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:26,219 INFO L225 Difference]: With dead ends: 1462 [2025-03-04 11:36:26,219 INFO L226 Difference]: Without dead ends: 1460 [2025-03-04 11:36:26,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:26,223 INFO L435 NwaCegarLoop]: 1619 mSDtfsCounter, 3 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3233 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:26,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3233 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:36:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-04 11:36:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1456. [2025-03-04 11:36:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1060 states have (on average 1.519811320754717) internal successors, (1611), 1282 states have internal predecessors, (1611), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 11:36:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1885 transitions. [2025-03-04 11:36:26,270 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1885 transitions. Word has length 23 [2025-03-04 11:36:26,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:26,270 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1885 transitions. [2025-03-04 11:36:26,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1885 transitions. [2025-03-04 11:36:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 11:36:26,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:26,271 INFO L218 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] [2025-03-04 11:36:26,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:36:26,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:26,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1068651549, now seen corresponding path program 1 times [2025-03-04 11:36:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:26,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123502552] [2025-03-04 11:36:26,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:26,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:36:26,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:36:26,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:26,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123502552] [2025-03-04 11:36:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123502552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629837444] [2025-03-04 11:36:26,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:26,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:26,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:26,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:26,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:36:27,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 11:36:27,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 11:36:27,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:27,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:27,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:27,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:27,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629837444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:27,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:27,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:27,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320002995] [2025-03-04 11:36:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:27,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:27,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:27,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:27,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:27,726 INFO L87 Difference]: Start difference. First operand 1456 states and 1885 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:29,146 INFO L93 Difference]: Finished difference Result 1458 states and 1885 transitions. [2025-03-04 11:36:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-04 11:36:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:29,152 INFO L225 Difference]: With dead ends: 1458 [2025-03-04 11:36:29,153 INFO L226 Difference]: Without dead ends: 1456 [2025-03-04 11:36:29,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:29,156 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 48 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4816 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:29,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4816 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 11:36:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2025-03-04 11:36:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1454. [2025-03-04 11:36:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1060 states have (on average 1.5160377358490567) internal successors, (1607), 1280 states have internal predecessors, (1607), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 11:36:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1881 transitions. [2025-03-04 11:36:29,196 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1881 transitions. Word has length 24 [2025-03-04 11:36:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:29,196 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1881 transitions. [2025-03-04 11:36:29,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1881 transitions. [2025-03-04 11:36:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:36:29,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:29,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:29,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:36:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:29,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1231539633, now seen corresponding path program 1 times [2025-03-04 11:36:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075946420] [2025-03-04 11:36:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:29,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:36:29,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:36:29,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:29,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:36:29,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:29,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075946420] [2025-03-04 11:36:29,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075946420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:29,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:29,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:29,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568901643] [2025-03-04 11:36:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:29,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:29,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:29,902 INFO L87 Difference]: Start difference. First operand 1454 states and 1881 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:30,733 INFO L93 Difference]: Finished difference Result 1456 states and 1881 transitions. [2025-03-04 11:36:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 11:36:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:30,739 INFO L225 Difference]: With dead ends: 1456 [2025-03-04 11:36:30,740 INFO L226 Difference]: Without dead ends: 1455 [2025-03-04 11:36:30,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:30,741 INFO L435 NwaCegarLoop]: 1608 mSDtfsCounter, 24 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:30,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3212 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:36:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-03-04 11:36:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1447. [2025-03-04 11:36:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1054 states have (on average 1.51707779886148) internal successors, (1599), 1273 states have internal predecessors, (1599), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 11:36:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1873 transitions. [2025-03-04 11:36:30,772 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1873 transitions. Word has length 25 [2025-03-04 11:36:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:30,772 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1873 transitions. [2025-03-04 11:36:30,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1873 transitions. [2025-03-04 11:36:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:36:30,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:30,773 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:36:30,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:36:30,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:30,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1064096859, now seen corresponding path program 1 times [2025-03-04 11:36:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111397996] [2025-03-04 11:36:30,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:31,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:36:31,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:36:31,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111397996] [2025-03-04 11:36:31,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111397996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:31,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135492549] [2025-03-04 11:36:31,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:31,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:31,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:36:32,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:36:32,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:36:32,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:32,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:32,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:32,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:32,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135492549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:32,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028902985] [2025-03-04 11:36:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:32,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:32,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:32,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:32,405 INFO L87 Difference]: Start difference. First operand 1447 states and 1873 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:33,062 INFO L93 Difference]: Finished difference Result 1451 states and 1877 transitions. [2025-03-04 11:36:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:33,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 11:36:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:33,067 INFO L225 Difference]: With dead ends: 1451 [2025-03-04 11:36:33,067 INFO L226 Difference]: Without dead ends: 1450 [2025-03-04 11:36:33,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:33,068 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 5 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:33,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3228 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-04 11:36:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1446. [2025-03-04 11:36:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1054 states have (on average 1.5132827324478177) internal successors, (1595), 1272 states have internal predecessors, (1595), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 11:36:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1869 transitions. [2025-03-04 11:36:33,102 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1869 transitions. Word has length 29 [2025-03-04 11:36:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:33,102 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1869 transitions. [2025-03-04 11:36:33,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1869 transitions. [2025-03-04 11:36:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 11:36:33,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:33,104 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:36:33,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:36:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:36:33,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:33,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1372736492, now seen corresponding path program 1 times [2025-03-04 11:36:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789871188] [2025-03-04 11:36:33,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:33,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:36:33,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:36:33,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:33,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789871188] [2025-03-04 11:36:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789871188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677054740] [2025-03-04 11:36:33,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:33,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:33,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:33,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:36:34,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 11:36:34,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 11:36:34,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:34,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:34,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1345 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:34,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:34,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677054740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:34,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:34,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922374626] [2025-03-04 11:36:34,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:34,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:34,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:34,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:34,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:34,834 INFO L87 Difference]: Start difference. First operand 1446 states and 1869 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:35,714 INFO L93 Difference]: Finished difference Result 1535 states and 1993 transitions. [2025-03-04 11:36:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 11:36:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:35,722 INFO L225 Difference]: With dead ends: 1535 [2025-03-04 11:36:35,723 INFO L226 Difference]: Without dead ends: 1534 [2025-03-04 11:36:35,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:35,724 INFO L435 NwaCegarLoop]: 1615 mSDtfsCounter, 12 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:35,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4846 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:36:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-03-04 11:36:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1518. [2025-03-04 11:36:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1126 states have (on average 1.5017761989342806) internal successors, (1691), 1344 states have internal predecessors, (1691), 137 states have call successors, (137), 46 states have call predecessors, (137), 46 states have return successors, (137), 132 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-04 11:36:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1965 transitions. [2025-03-04 11:36:35,753 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1965 transitions. Word has length 30 [2025-03-04 11:36:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:35,756 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 1965 transitions. [2025-03-04 11:36:35,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:35,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1965 transitions. [2025-03-04 11:36:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:36:35,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:35,757 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:36:35,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:35,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:35,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:35,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:35,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1288059889, now seen corresponding path program 1 times [2025-03-04 11:36:35,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:35,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165640348] [2025-03-04 11:36:35,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:36,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:36:36,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:36:36,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:36,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:36,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165640348] [2025-03-04 11:36:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165640348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468328656] [2025-03-04 11:36:36,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:36,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:36,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:36,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:36,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:36:37,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:36:37,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:36:37,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:37,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:37,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:37,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:36:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468328656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:37,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:37,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260758143] [2025-03-04 11:36:37,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:37,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:37,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:37,705 INFO L87 Difference]: Start difference. First operand 1518 states and 1965 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:39,179 INFO L93 Difference]: Finished difference Result 3294 states and 4291 transitions. [2025-03-04 11:36:39,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:39,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 11:36:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:39,185 INFO L225 Difference]: With dead ends: 3294 [2025-03-04 11:36:39,185 INFO L226 Difference]: Without dead ends: 1792 [2025-03-04 11:36:39,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:39,189 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 92 mSDsluCounter, 4837 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 6443 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:39,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 6443 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 11:36:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2025-03-04 11:36:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1778. [2025-03-04 11:36:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1380 states have (on average 1.4746376811594204) internal successors, (2035), 1598 states have internal predecessors, (2035), 143 states have call successors, (143), 46 states have call predecessors, (143), 46 states have return successors, (143), 138 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-04 11:36:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2321 transitions. [2025-03-04 11:36:39,224 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2321 transitions. Word has length 32 [2025-03-04 11:36:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:39,225 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2321 transitions. [2025-03-04 11:36:39,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2321 transitions. [2025-03-04 11:36:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:36:39,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:39,226 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:36:39,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:36:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:39,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -861188364, now seen corresponding path program 1 times [2025-03-04 11:36:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914237158] [2025-03-04 11:36:39,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:39,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:36:39,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:36:39,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:39,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:36:39,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:39,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914237158] [2025-03-04 11:36:39,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914237158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:39,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:39,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77222389] [2025-03-04 11:36:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:39,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:39,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:39,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:39,881 INFO L87 Difference]: Start difference. First operand 1778 states and 2321 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:36:43,900 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 [] [2025-03-04 11:36:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:44,706 INFO L93 Difference]: Finished difference Result 3792 states and 4972 transitions. [2025-03-04 11:36:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:44,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2025-03-04 11:36:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:44,714 INFO L225 Difference]: With dead ends: 3792 [2025-03-04 11:36:44,715 INFO L226 Difference]: Without dead ends: 2030 [2025-03-04 11:36:44,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:44,719 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 81 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:44,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 3281 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 11:36:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-03-04 11:36:44,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2028. [2025-03-04 11:36:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1624 states have (on average 1.457512315270936) internal successors, (2367), 1842 states have internal predecessors, (2367), 148 states have call successors, (148), 47 states have call predecessors, (148), 47 states have return successors, (148), 143 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-04 11:36:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2663 transitions. [2025-03-04 11:36:44,756 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2663 transitions. Word has length 47 [2025-03-04 11:36:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 2663 transitions. [2025-03-04 11:36:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:36:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2663 transitions. [2025-03-04 11:36:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:36:44,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:44,758 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 11:36:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:36:44,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -925556105, now seen corresponding path program 1 times [2025-03-04 11:36:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:44,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638377652] [2025-03-04 11:36:44,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:45,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 11:36:45,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 11:36:45,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:45,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:36:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638377652] [2025-03-04 11:36:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638377652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:45,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:45,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:45,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141423589] [2025-03-04 11:36:45,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:45,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:45,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:45,228 INFO L87 Difference]: Start difference. First operand 2028 states and 2663 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:36:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:45,936 INFO L93 Difference]: Finished difference Result 2539 states and 3353 transitions. [2025-03-04 11:36:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2025-03-04 11:36:45,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:45,944 INFO L225 Difference]: With dead ends: 2539 [2025-03-04 11:36:45,945 INFO L226 Difference]: Without dead ends: 2537 [2025-03-04 11:36:45,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:45,946 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 66 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 3224 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:45,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 3224 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:36:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-03-04 11:36:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-03-04 11:36:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2115 states have (on average 1.433096926713948) internal successors, (3031), 2333 states have internal predecessors, (3031), 160 states have call successors, (160), 51 states have call predecessors, (160), 51 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-04 11:36:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3351 transitions. [2025-03-04 11:36:45,986 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3351 transitions. Word has length 48 [2025-03-04 11:36:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:45,986 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3351 transitions. [2025-03-04 11:36:45,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:36:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3351 transitions. [2025-03-04 11:36:45,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 11:36:45,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:45,987 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:45,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:36:45,987 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:45,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:45,987 INFO L85 PathProgramCache]: Analyzing trace with hash 189198845, now seen corresponding path program 2 times [2025-03-04 11:36:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546465284] [2025-03-04 11:36:45,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:36:45,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:46,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 11:36:46,335 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 48 statements. [2025-03-04 11:36:46,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:36:46,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:36:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546465284] [2025-03-04 11:36:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546465284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801151484] [2025-03-04 11:36:51,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:36:51,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:51,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:51,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:51,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:36:51,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-04 11:36:51,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 48 statements. [2025-03-04 11:36:51,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:36:51,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:51,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:36:51,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:36:52,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801151484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:52,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-03-04 11:36:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602266131] [2025-03-04 11:36:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:52,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:52,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:52,499 INFO L87 Difference]: Start difference. First operand 2535 states and 3351 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:56,517 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 [] [2025-03-04 11:36:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:58,617 INFO L93 Difference]: Finished difference Result 3995 states and 5232 transitions. [2025-03-04 11:36:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-04 11:36:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:58,624 INFO L225 Difference]: With dead ends: 3995 [2025-03-04 11:36:58,624 INFO L226 Difference]: Without dead ends: 1476 [2025-03-04 11:36:58,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:58,628 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 1675 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2912 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:58,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 2912 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-03-04 11:36:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-03-04 11:36:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1476. [2025-03-04 11:36:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1087 states have (on average 1.4931002759889604) internal successors, (1623), 1303 states have internal predecessors, (1623), 135 states have call successors, (135), 47 states have call predecessors, (135), 47 states have return successors, (135), 130 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 11:36:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1893 transitions. [2025-03-04 11:36:58,661 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1893 transitions. Word has length 48 [2025-03-04 11:36:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:58,661 INFO L471 AbstractCegarLoop]: Abstraction has 1476 states and 1893 transitions. [2025-03-04 11:36:58,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:36:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1893 transitions. [2025-03-04 11:36:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 11:36:58,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:58,662 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 11:36:58,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:58,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:36:58,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:36:58,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash -415818023, now seen corresponding path program 1 times [2025-03-04 11:36:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:58,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631234610] [2025-03-04 11:36:58,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:59,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:36:59,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:36:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:36:59,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631234610] [2025-03-04 11:36:59,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631234610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:59,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284480833] [2025-03-04 11:36:59,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:59,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:59,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:37:00,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 11:37:00,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 11:37:00,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:00,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:00,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 1471 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:37:00,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:37:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:37:00,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:37:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:37:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284480833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:37:00,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:37:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-04 11:37:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907611488] [2025-03-04 11:37:00,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:37:00,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:37:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:00,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:37:00,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:37:00,654 INFO L87 Difference]: Start difference. First operand 1476 states and 1893 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:37:04,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 11:37:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:07,185 INFO L93 Difference]: Finished difference Result 4437 states and 5701 transitions. [2025-03-04 11:37:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:37:07,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 58 [2025-03-04 11:37:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:07,194 INFO L225 Difference]: With dead ends: 4437 [2025-03-04 11:37:07,194 INFO L226 Difference]: Without dead ends: 2977 [2025-03-04 11:37:07,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:37:07,197 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 1745 mSDsluCounter, 7785 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 9424 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:07,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 9424 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 952 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-03-04 11:37:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2025-03-04 11:37:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2773. [2025-03-04 11:37:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2210 states have (on average 1.4737556561085974) internal successors, (3257), 2436 states have internal predecessors, (3257), 266 states have call successors, (266), 90 states have call predecessors, (266), 90 states have return successors, (266), 256 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-04 11:37:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3789 transitions. [2025-03-04 11:37:07,249 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3789 transitions. Word has length 58 [2025-03-04 11:37:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:07,249 INFO L471 AbstractCegarLoop]: Abstraction has 2773 states and 3789 transitions. [2025-03-04 11:37:07,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:37:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3789 transitions. [2025-03-04 11:37:07,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 11:37:07,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:07,250 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 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] [2025-03-04 11:37:07,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:37:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:37:07,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:07,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:07,453 INFO L85 PathProgramCache]: Analyzing trace with hash 744477187, now seen corresponding path program 1 times [2025-03-04 11:37:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:07,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093602121] [2025-03-04 11:37:07,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:07,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:37:07,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:37:07,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:07,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 11:37:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:07,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093602121] [2025-03-04 11:37:07,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093602121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:37:07,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416356047] [2025-03-04 11:37:07,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:07,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:37:07,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:37:07,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:37:07,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:37:08,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 11:37:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 11:37:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:08,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:08,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:37:08,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:37:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:37:09,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:37:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 11:37:09,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416356047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:37:09,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:37:09,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 18 [2025-03-04 11:37:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963329834] [2025-03-04 11:37:09,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:37:09,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:37:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:09,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:37:09,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:37:09,469 INFO L87 Difference]: Start difference. First operand 2773 states and 3789 transitions. Second operand has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:37:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:12,074 INFO L93 Difference]: Finished difference Result 7406 states and 9945 transitions. [2025-03-04 11:37:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:37:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2025-03-04 11:37:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:12,088 INFO L225 Difference]: With dead ends: 7406 [2025-03-04 11:37:12,088 INFO L226 Difference]: Without dead ends: 4649 [2025-03-04 11:37:12,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=720, Invalid=1350, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 11:37:12,092 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 1775 mSDsluCounter, 6050 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 7634 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:12,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 7634 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 11:37:12,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2025-03-04 11:37:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4446. [2025-03-04 11:37:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4446 states, 3705 states have (on average 1.4240215924426451) internal successors, (5276), 3941 states have internal predecessors, (5276), 399 states have call successors, (399), 135 states have call predecessors, (399), 135 states have return successors, (399), 384 states have call predecessors, (399), 399 states have call successors, (399) [2025-03-04 11:37:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 6074 transitions. [2025-03-04 11:37:12,171 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 6074 transitions. Word has length 75 [2025-03-04 11:37:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:12,171 INFO L471 AbstractCegarLoop]: Abstraction has 4446 states and 6074 transitions. [2025-03-04 11:37:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.444444444444445) internal successors, (134), 18 states have internal predecessors, (134), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:37:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 6074 transitions. [2025-03-04 11:37:12,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:37:12,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:12,174 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 3, 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] [2025-03-04 11:37:12,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:37:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:37:12,375 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting analog_disconnectErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1208075128, now seen corresponding path program 1 times [2025-03-04 11:37:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500125109] [2025-03-04 11:37:12,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:12,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:37:12,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:37:12,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:12,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-04 11:37:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500125109] [2025-03-04 11:37:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500125109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:37:12,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:37:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:37:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505124899] [2025-03-04 11:37:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:37:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:37:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:37:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:37:12,934 INFO L87 Difference]: Start difference. First operand 4446 states and 6074 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:37:16,958 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 [] [2025-03-04 11:37:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:17,347 INFO L93 Difference]: Finished difference Result 9114 states and 12417 transitions. [2025-03-04 11:37:17,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:37:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 119 [2025-03-04 11:37:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:17,365 INFO L225 Difference]: With dead ends: 9114 [2025-03-04 11:37:17,365 INFO L226 Difference]: Without dead ends: 4863 [2025-03-04 11:37:17,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:37:17,374 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1643 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:17,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 1808 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 11:37:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2025-03-04 11:37:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 4857. [2025-03-04 11:37:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4857 states, 4065 states have (on average 1.401968019680197) internal successors, (5699), 4301 states have internal predecessors, (5699), 423 states have call successors, (423), 162 states have call predecessors, (423), 162 states have return successors, (423), 408 states have call predecessors, (423), 423 states have call successors, (423) [2025-03-04 11:37:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 6545 transitions. [2025-03-04 11:37:17,541 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 6545 transitions. Word has length 119 [2025-03-04 11:37:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:17,542 INFO L471 AbstractCegarLoop]: Abstraction has 4857 states and 6545 transitions. [2025-03-04 11:37:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:37:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 6545 transitions. [2025-03-04 11:37:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 11:37:17,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:17,547 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 4, 3, 3, 3, 3, 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] [2025-03-04 11:37:17,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:37:17,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:17,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:17,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1957057318, now seen corresponding path program 1 times [2025-03-04 11:37:17,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:17,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006341887] [2025-03-04 11:37:17,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:17,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:17,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 11:37:17,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 11:37:17,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:17,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 11:37:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006341887] [2025-03-04 11:37:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006341887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:37:18,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:37:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:37:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378425119] [2025-03-04 11:37:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:37:18,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:37:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:18,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:37:18,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:37:18,004 INFO L87 Difference]: Start difference. First operand 4857 states and 6545 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:37:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:18,518 INFO L93 Difference]: Finished difference Result 4960 states and 6663 transitions. [2025-03-04 11:37:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:37:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2025-03-04 11:37:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:18,533 INFO L225 Difference]: With dead ends: 4960 [2025-03-04 11:37:18,533 INFO L226 Difference]: Without dead ends: 4958 [2025-03-04 11:37:18,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:37:18,535 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1732 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:18,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 1642 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:37:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2025-03-04 11:37:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 3302. [2025-03-04 11:37:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2707 states have (on average 1.4011821204285186) internal successors, (3793), 2931 states have internal predecessors, (3793), 282 states have call successors, (282), 108 states have call predecessors, (282), 108 states have return successors, (282), 272 states have call predecessors, (282), 282 states have call successors, (282) [2025-03-04 11:37:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4357 transitions. [2025-03-04 11:37:18,600 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4357 transitions. Word has length 117 [2025-03-04 11:37:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:18,600 INFO L471 AbstractCegarLoop]: Abstraction has 3302 states and 4357 transitions. [2025-03-04 11:37:18,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:37:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4357 transitions. [2025-03-04 11:37:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 11:37:18,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:18,603 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 5, 4, 4, 4, 4, 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] [2025-03-04 11:37:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:37:18,603 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash -8328916, now seen corresponding path program 1 times [2025-03-04 11:37:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116329469] [2025-03-04 11:37:18,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:18,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 11:37:18,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 11:37:18,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-04 11:37:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116329469] [2025-03-04 11:37:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116329469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:37:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:37:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:37:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686277609] [2025-03-04 11:37:19,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:37:19,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:37:19,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:19,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:37:19,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:37:19,035 INFO L87 Difference]: Start difference. First operand 3302 states and 4357 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:37:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:19,575 INFO L93 Difference]: Finished difference Result 3302 states and 4357 transitions. [2025-03-04 11:37:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:37:19,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2025-03-04 11:37:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:19,584 INFO L225 Difference]: With dead ends: 3302 [2025-03-04 11:37:19,585 INFO L226 Difference]: Without dead ends: 3301 [2025-03-04 11:37:19,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:37:19,587 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 1671 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:19,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 1586 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:37:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2025-03-04 11:37:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2025-03-04 11:37:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 2707 states have (on average 1.4008127077946066) internal successors, (3792), 2930 states have internal predecessors, (3792), 282 states have call successors, (282), 108 states have call predecessors, (282), 108 states have return successors, (282), 272 states have call predecessors, (282), 282 states have call successors, (282) [2025-03-04 11:37:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4356 transitions. [2025-03-04 11:37:19,656 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4356 transitions. Word has length 128 [2025-03-04 11:37:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 4356 transitions. [2025-03-04 11:37:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:37:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4356 transitions. [2025-03-04 11:37:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 11:37:19,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:19,658 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 4, 3, 3, 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] [2025-03-04 11:37:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:37:19,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting analog_disconnectErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1428339446, now seen corresponding path program 1 times [2025-03-04 11:37:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846969966] [2025-03-04 11:37:19,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 11:37:20,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 11:37:20,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-04 11:37:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846969966] [2025-03-04 11:37:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846969966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:37:20,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:37:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:37:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158733871] [2025-03-04 11:37:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:37:20,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:37:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:20,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:37:20,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:37:20,223 INFO L87 Difference]: Start difference. First operand 3301 states and 4356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:37:24,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 11:37:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:25,361 INFO L93 Difference]: Finished difference Result 9087 states and 12140 transitions. [2025-03-04 11:37:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:37:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 135 [2025-03-04 11:37:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:25,375 INFO L225 Difference]: With dead ends: 9087 [2025-03-04 11:37:25,376 INFO L226 Difference]: Without dead ends: 5981 [2025-03-04 11:37:25,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:37:25,383 INFO L435 NwaCegarLoop]: 3168 mSDtfsCounter, 1671 mSDsluCounter, 4748 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1671 SdHoareTripleChecker+Valid, 7916 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:25,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1671 Valid, 7916 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-04 11:37:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2025-03-04 11:37:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3305. [2025-03-04 11:37:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2711 states have (on average 1.400221320545924) internal successors, (3796), 2934 states have internal predecessors, (3796), 282 states have call successors, (282), 108 states have call predecessors, (282), 108 states have return successors, (282), 272 states have call predecessors, (282), 282 states have call successors, (282) [2025-03-04 11:37:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4360 transitions. [2025-03-04 11:37:25,466 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4360 transitions. Word has length 135 [2025-03-04 11:37:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:25,466 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 4360 transitions. [2025-03-04 11:37:25,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:37:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4360 transitions. [2025-03-04 11:37:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 11:37:25,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:25,468 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 3, 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] [2025-03-04 11:37:25,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:37:25,468 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:25,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1516327351, now seen corresponding path program 1 times [2025-03-04 11:37:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128358596] [2025-03-04 11:37:25,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:25,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 11:37:25,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 11:37:25,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:25,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-04 11:37:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:25,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128358596] [2025-03-04 11:37:25,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128358596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:37:25,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:37:25,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:37:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678394016] [2025-03-04 11:37:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:37:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:37:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:25,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:37:25,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:37:25,900 INFO L87 Difference]: Start difference. First operand 3305 states and 4360 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:37:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:26,438 INFO L93 Difference]: Finished difference Result 6553 states and 8725 transitions. [2025-03-04 11:37:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:37:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 137 [2025-03-04 11:37:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:26,447 INFO L225 Difference]: With dead ends: 6553 [2025-03-04 11:37:26,447 INFO L226 Difference]: Without dead ends: 3443 [2025-03-04 11:37:26,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:37:26,452 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 66 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:26,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 3155 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:37:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2025-03-04 11:37:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3357. [2025-03-04 11:37:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 2757 states have (on average 1.3986216902430177) internal successors, (3856), 2980 states have internal predecessors, (3856), 288 states have call successors, (288), 108 states have call predecessors, (288), 108 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2025-03-04 11:37:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4432 transitions. [2025-03-04 11:37:26,527 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4432 transitions. Word has length 137 [2025-03-04 11:37:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:26,527 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 4432 transitions. [2025-03-04 11:37:26,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:37:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4432 transitions. [2025-03-04 11:37:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 11:37:26,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:26,529 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:37:26,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:37:26,529 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -149066529, now seen corresponding path program 1 times [2025-03-04 11:37:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966414773] [2025-03-04 11:37:26,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:26,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 11:37:26,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 11:37:26,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:26,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 10 proven. 378 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-04 11:37:27,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966414773] [2025-03-04 11:37:27,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966414773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:37:27,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949055181] [2025-03-04 11:37:27,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:37:27,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:37:27,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:37:27,543 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:37:27,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:37:28,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 11:37:28,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 11:37:28,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:37:28,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:28,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:37:28,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:37:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 14 proven. 378 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-04 11:37:28,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:37:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 10 proven. 378 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-04 11:37:29,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949055181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:37:29,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:37:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 19 [2025-03-04 11:37:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47563683] [2025-03-04 11:37:29,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:37:29,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:37:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:37:29,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:37:29,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:37:29,433 INFO L87 Difference]: Start difference. First operand 3357 states and 4432 transitions. Second operand has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:37:30,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:37:30,530 INFO L93 Difference]: Finished difference Result 6778 states and 8947 transitions. [2025-03-04 11:37:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:37:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 139 [2025-03-04 11:37:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:37:30,538 INFO L225 Difference]: With dead ends: 6778 [2025-03-04 11:37:30,538 INFO L226 Difference]: Without dead ends: 3437 [2025-03-04 11:37:30,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 262 SyntacticMatches, 14 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:37:30,544 INFO L435 NwaCegarLoop]: 1587 mSDtfsCounter, 3 mSDsluCounter, 6336 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 7923 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:37:30,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 7923 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:37:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2025-03-04 11:37:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2025-03-04 11:37:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 2837 states have (on average 1.387381036305957) internal successors, (3936), 3060 states have internal predecessors, (3936), 288 states have call successors, (288), 108 states have call predecessors, (288), 108 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2025-03-04 11:37:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 4512 transitions. [2025-03-04 11:37:30,636 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 4512 transitions. Word has length 139 [2025-03-04 11:37:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:37:30,636 INFO L471 AbstractCegarLoop]: Abstraction has 3437 states and 4512 transitions. [2025-03-04 11:37:30,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.894736842105263) internal successors, (112), 19 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:37:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 4512 transitions. [2025-03-04 11:37:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 11:37:30,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:37:30,639 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:37:30,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:37:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:37:30,842 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [analog_decodeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, analog_decodeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 232 more)] === [2025-03-04 11:37:30,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:37:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1381447895, now seen corresponding path program 2 times [2025-03-04 11:37:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:37:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572664808] [2025-03-04 11:37:30,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:37:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:37:31,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-04 11:37:31,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 11:37:31,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:37:31,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:37:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-03-04 11:37:31,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:37:31,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572664808] [2025-03-04 11:37:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572664808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:37:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159836614] [2025-03-04 11:37:31,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:37:31,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:37:31,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:37:31,463 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:37:31,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:37:32,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes.