./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 12:56:05,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 12:56:05,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 12:56:05,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 12:56:05,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 12:56:05,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 12:56:05,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 12:56:05,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 12:56:05,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 12:56:05,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 12:56:05,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 12:56:05,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 12:56:05,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 12:56:05,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 12:56:05,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 12:56:05,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 12:56:05,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 12:56:05,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 12:56:05,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 12:56:05,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 12:56:05,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 12:56:05,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 12:56:05,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 12:56:05,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 12:56:05,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 12:56:05,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 12:56:05,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 12:56:05,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 12:56:05,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 12:56:05,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 12:56:05,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 12:56:05,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 12:56:05,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 12:56:05,994 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aefe7c24f7dbfd113682bd81b91ef3b049ad438c933de49acd0f78d1e093848 [2024-11-07 12:56:06,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 12:56:06,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 12:56:06,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 12:56:06,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 12:56:06,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 12:56:06,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2024-11-07 12:56:07,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 12:56:08,145 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 12:56:08,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2024-11-07 12:56:08,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9f8c0cf/e7052f8106834da095a207dfdb9205f4/FLAGc7750dcca [2024-11-07 12:56:08,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4e9f8c0cf/e7052f8106834da095a207dfdb9205f4 [2024-11-07 12:56:08,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 12:56:08,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 12:56:08,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 12:56:08,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 12:56:08,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 12:56:08,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:08" (1/1) ... [2024-11-07 12:56:08,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fa9797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:08, skipping insertion in model container [2024-11-07 12:56:08,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:56:08" (1/1) ... [2024-11-07 12:56:08,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 12:56:09,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2024-11-07 12:56:09,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 12:56:09,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 12:56:09,753 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"); [3073] [2024-11-07 12:56:09,757 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3087-3088] [2024-11-07 12:56:09,759 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [3102] [2024-11-07 12:56:09,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3105] [2024-11-07 12:56:09,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3108] [2024-11-07 12:56:09,760 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [3111] [2024-11-07 12:56:09,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& kernel_stack)); [3173] [2024-11-07 12:56:09,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3176] [2024-11-07 12:56:09,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3179] [2024-11-07 12:56:09,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& kernel_stack)); [3182] [2024-11-07 12:56:09,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i[133672,133685] [2024-11-07 12:56:09,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 12:56:10,009 INFO L204 MainTranslator]: Completed translation [2024-11-07 12:56:10,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10 WrapperNode [2024-11-07 12:56:10,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 12:56:10,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 12:56:10,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 12:56:10,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 12:56:10,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,197 INFO L138 Inliner]: procedures = 191, calls = 833, calls flagged for inlining = 89, calls inlined = 75, statements flattened = 2352 [2024-11-07 12:56:10,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 12:56:10,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 12:56:10,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 12:56:10,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 12:56:10,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,428 INFO L175 MemorySlicer]: Split 435 memory accesses to 14 slices as follows [2, 35, 113, 8, 7, 7, 7, 9, 1, 3, 5, 2, 234, 2]. 54 percent of accesses are in the largest equivalence class. The 39 initializations are split as follows [2, 7, 0, 0, 7, 7, 7, 9, 0, 0, 0, 0, 0, 0]. The 171 writes are split as follows [0, 28, 103, 1, 0, 0, 0, 0, 0, 0, 5, 0, 34, 0]. [2024-11-07 12:56:10,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 12:56:10,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 12:56:10,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 12:56:10,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 12:56:10,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (1/1) ... [2024-11-07 12:56:10,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 12:56:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 12:56:10,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 12:56:10,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 12:56:10,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 12:56:10,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 12:56:10,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2024-11-07 12:56:10,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2024-11-07 12:56:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2024-11-07 12:56:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2024-11-07 12:56:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure input_event_size [2024-11-07 12:56:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event_size [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-07 12:56:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 12:56:10,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2024-11-07 12:56:10,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_uinput_device [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-11-07 12:56:10,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2024-11-07 12:56:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2024-11-07 12:56:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2024-11-07 12:56:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2024-11-07 12:56:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2024-11-07 12:56:10,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2024-11-07 12:56:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-11-07 12:56:10,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-11-07 12:56:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-11-07 12:56:10,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_done [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_done [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-07 12:56:10,670 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-07 12:56:10,670 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_flat [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_flat [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure input_alloc_absinfo [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure input_alloc_absinfo [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-11-07 12:56:10,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-07 12:56:10,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_request_find [2024-11-07 12:56:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_request_find [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_uinput_device [2024-11-07 12:56:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_uinput_device [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_allocate_device [2024-11-07 12:56:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_allocate_device [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2024-11-07 12:56:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ioctl_handler [2024-11-07 12:56:10,672 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ioctl_handler [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 12:56:10,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2024-11-07 12:56:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __bad_percpu_size [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_ff_upload_from_user [2024-11-07 12:56:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_ff_upload_from_user [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure uinput_destroy_device [2024-11-07 12:56:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure uinput_destroy_device [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-07 12:56:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_max [2024-11-07 12:56:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_max [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2024-11-07 12:56:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-11-07 12:56:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2024-11-07 12:56:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2024-11-07 12:56:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_get_min [2024-11-07 12:56:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_get_min [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-07 12:56:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure is_compat_task [2024-11-07 12:56:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure is_compat_task [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2024-11-07 12:56:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait [2024-11-07 12:56:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-07 12:56:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-11-07 12:56:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2024-11-07 12:56:10,679 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2024-11-07 12:56:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2024-11-07 12:56:10,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2024-11-07 12:56:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2024-11-07 12:56:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-11-07 12:56:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2024-11-07 12:56:10,683 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-07 12:56:10,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-11-07 12:56:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2024-11-07 12:56:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 12:56:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 12:56:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-11-07 12:56:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-11-07 12:56:11,295 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 12:56:11,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 12:56:24,310 INFO L? ?]: Removed 1208 outVars from TransFormulas that were not future-live. [2024-11-07 12:56:24,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 12:56:24,360 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 12:56:24,364 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 12:56:24,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:24 BoogieIcfgContainer [2024-11-07 12:56:24,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 12:56:24,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 12:56:24,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 12:56:24,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 12:56:24,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:56:08" (1/3) ... [2024-11-07 12:56:24,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5348f51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:24, skipping insertion in model container [2024-11-07 12:56:24,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:56:10" (2/3) ... [2024-11-07 12:56:24,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5348f51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:56:24, skipping insertion in model container [2024-11-07 12:56:24,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:56:24" (3/3) ... [2024-11-07 12:56:24,379 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--input--misc--uinput.ko-ldv_main0.cil.out.i [2024-11-07 12:56:24,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 12:56:24,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 12:56:24,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 12:56:24,522 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;@76ecbbf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 12:56:24,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 12:56:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 716 states, 528 states have (on average 1.3579545454545454) internal successors, (717), 542 states have internal predecessors, (717), 142 states have call successors, (142), 44 states have call predecessors, (142), 44 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-07 12:56:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 12:56:24,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:24,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:24,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:24,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2073045771, now seen corresponding path program 1 times [2024-11-07 12:56:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:24,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862333029] [2024-11-07 12:56:24,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 12:56:25,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:25,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862333029] [2024-11-07 12:56:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862333029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 12:56:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342653471] [2024-11-07 12:56:25,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 12:56:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 12:56:25,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 12:56:25,330 INFO L87 Difference]: Start difference. First operand has 716 states, 528 states have (on average 1.3579545454545454) internal successors, (717), 542 states have internal predecessors, (717), 142 states have call successors, (142), 44 states have call predecessors, (142), 44 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 12:56:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:26,220 INFO L93 Difference]: Finished difference Result 1421 states and 2005 transitions. [2024-11-07 12:56:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 12:56:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-07 12:56:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:26,245 INFO L225 Difference]: With dead ends: 1421 [2024-11-07 12:56:26,245 INFO L226 Difference]: Without dead ends: 709 [2024-11-07 12:56:26,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 12:56:26,262 INFO L432 NwaCegarLoop]: 989 mSDtfsCounter, 981 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:26,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 989 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 12:56:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-07 12:56:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2024-11-07 12:56:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 524 states have (on average 1.3511450381679388) internal successors, (708), 535 states have internal predecessors, (708), 141 states have call successors, (141), 44 states have call predecessors, (141), 43 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2024-11-07 12:56:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 986 transitions. [2024-11-07 12:56:26,388 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 986 transitions. Word has length 14 [2024-11-07 12:56:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:26,391 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 986 transitions. [2024-11-07 12:56:26,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 12:56:26,391 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 986 transitions. [2024-11-07 12:56:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 12:56:26,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:26,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:26,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 12:56:26,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:26,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash 159806965, now seen corresponding path program 1 times [2024-11-07 12:56:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:26,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151063731] [2024-11-07 12:56:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:26,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 12:56:26,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151063731] [2024-11-07 12:56:26,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151063731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:26,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 12:56:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750964774] [2024-11-07 12:56:26,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 12:56:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:26,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 12:56:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 12:56:26,794 INFO L87 Difference]: Start difference. First operand 709 states and 986 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 12:56:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:27,655 INFO L93 Difference]: Finished difference Result 711 states and 987 transitions. [2024-11-07 12:56:27,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 12:56:27,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-07 12:56:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:27,666 INFO L225 Difference]: With dead ends: 711 [2024-11-07 12:56:27,667 INFO L226 Difference]: Without dead ends: 708 [2024-11-07 12:56:27,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 12:56:27,669 INFO L432 NwaCegarLoop]: 983 mSDtfsCounter, 974 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:27,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 983 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 12:56:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-07 12:56:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2024-11-07 12:56:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 524 states have (on average 1.349236641221374) internal successors, (707), 534 states have internal predecessors, (707), 140 states have call successors, (140), 44 states have call predecessors, (140), 43 states have return successors, (137), 135 states have call predecessors, (137), 137 states have call successors, (137) [2024-11-07 12:56:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 984 transitions. [2024-11-07 12:56:27,744 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 984 transitions. Word has length 15 [2024-11-07 12:56:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 984 transitions. [2024-11-07 12:56:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 12:56:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 984 transitions. [2024-11-07 12:56:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 12:56:27,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:27,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:27,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 12:56:27,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 658769912, now seen corresponding path program 1 times [2024-11-07 12:56:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:27,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818330495] [2024-11-07 12:56:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:27,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 12:56:28,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:28,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818330495] [2024-11-07 12:56:28,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818330495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:28,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:28,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 12:56:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142223202] [2024-11-07 12:56:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:28,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 12:56:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 12:56:28,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 12:56:28,010 INFO L87 Difference]: Start difference. First operand 708 states and 984 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 12:56:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:28,797 INFO L93 Difference]: Finished difference Result 2052 states and 2874 transitions. [2024-11-07 12:56:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 12:56:28,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-07 12:56:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:28,812 INFO L225 Difference]: With dead ends: 2052 [2024-11-07 12:56:28,812 INFO L226 Difference]: Without dead ends: 1344 [2024-11-07 12:56:28,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 12:56:28,818 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 971 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:28,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2425 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 12:56:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-11-07 12:56:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1341. [2024-11-07 12:56:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 996 states have (on average 1.3483935742971886) internal successors, (1343), 1014 states have internal predecessors, (1343), 264 states have call successors, (264), 82 states have call predecessors, (264), 80 states have return successors, (268), 254 states have call predecessors, (268), 258 states have call successors, (268) [2024-11-07 12:56:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1875 transitions. [2024-11-07 12:56:28,944 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1875 transitions. Word has length 16 [2024-11-07 12:56:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:28,944 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 1875 transitions. [2024-11-07 12:56:28,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 12:56:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1875 transitions. [2024-11-07 12:56:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 12:56:28,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:28,953 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 12:56:28,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 12:56:28,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:28,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1891452212, now seen corresponding path program 1 times [2024-11-07 12:56:28,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:28,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527938829] [2024-11-07 12:56:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:29,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 12:56:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 12:56:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 12:56:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 12:56:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527938829] [2024-11-07 12:56:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527938829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:29,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:29,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 12:56:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128860371] [2024-11-07 12:56:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:29,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 12:56:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:29,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 12:56:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 12:56:29,324 INFO L87 Difference]: Start difference. First operand 1341 states and 1875 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 12:56:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:31,982 INFO L93 Difference]: Finished difference Result 2755 states and 3875 transitions. [2024-11-07 12:56:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 12:56:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-11-07 12:56:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:31,996 INFO L225 Difference]: With dead ends: 2755 [2024-11-07 12:56:31,996 INFO L226 Difference]: Without dead ends: 1422 [2024-11-07 12:56:32,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 12:56:32,003 INFO L432 NwaCegarLoop]: 927 mSDtfsCounter, 531 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:32,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 2189 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 12:56:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-07 12:56:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1411. [2024-11-07 12:56:32,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1056 states have (on average 1.3503787878787878) internal successors, (1426), 1074 states have internal predecessors, (1426), 274 states have call successors, (274), 82 states have call predecessors, (274), 80 states have return successors, (282), 264 states have call predecessors, (282), 268 states have call successors, (282) [2024-11-07 12:56:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1982 transitions. [2024-11-07 12:56:32,090 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1982 transitions. Word has length 44 [2024-11-07 12:56:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:32,090 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 1982 transitions. [2024-11-07 12:56:32,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 12:56:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1982 transitions. [2024-11-07 12:56:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 12:56:32,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:32,093 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 12:56:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 12:56:32,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -775648113, now seen corresponding path program 1 times [2024-11-07 12:56:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747460672] [2024-11-07 12:56:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:32,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:56:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:32,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 12:56:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 12:56:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 12:56:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:32,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747460672] [2024-11-07 12:56:32,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747460672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:32,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:32,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 12:56:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850062476] [2024-11-07 12:56:32,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:32,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 12:56:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 12:56:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 12:56:32,477 INFO L87 Difference]: Start difference. First operand 1411 states and 1982 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 12:56:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:36,591 INFO L93 Difference]: Finished difference Result 2818 states and 3961 transitions. [2024-11-07 12:56:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 12:56:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2024-11-07 12:56:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:36,601 INFO L225 Difference]: With dead ends: 2818 [2024-11-07 12:56:36,602 INFO L226 Difference]: Without dead ends: 1415 [2024-11-07 12:56:36,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:56:36,612 INFO L432 NwaCegarLoop]: 986 mSDtfsCounter, 1392 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:36,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 2069 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-07 12:56:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-07 12:56:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1404. [2024-11-07 12:56:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1053 states have (on average 1.3494776828110162) internal successors, (1421), 1069 states have internal predecessors, (1421), 270 states have call successors, (270), 82 states have call predecessors, (270), 80 states have return successors, (266), 262 states have call predecessors, (266), 259 states have call successors, (266) [2024-11-07 12:56:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1957 transitions. [2024-11-07 12:56:36,688 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1957 transitions. Word has length 55 [2024-11-07 12:56:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:36,689 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1957 transitions. [2024-11-07 12:56:36,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 12:56:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1957 transitions. [2024-11-07 12:56:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 12:56:36,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:36,694 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 12:56:36,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 12:56:36,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:36,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:36,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1307928859, now seen corresponding path program 1 times [2024-11-07 12:56:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099845756] [2024-11-07 12:56:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:37,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:56:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:56:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:37,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 12:56:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 12:56:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099845756] [2024-11-07 12:56:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099845756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:37,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:37,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 12:56:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315117870] [2024-11-07 12:56:37,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:37,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 12:56:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 12:56:37,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:56:37,128 INFO L87 Difference]: Start difference. First operand 1404 states and 1957 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 12:56:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:40,269 INFO L93 Difference]: Finished difference Result 1536 states and 2114 transitions. [2024-11-07 12:56:40,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 12:56:40,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2024-11-07 12:56:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:40,277 INFO L225 Difference]: With dead ends: 1536 [2024-11-07 12:56:40,277 INFO L226 Difference]: Without dead ends: 1178 [2024-11-07 12:56:40,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 12:56:40,281 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 281 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:40,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 3503 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 12:56:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2024-11-07 12:56:40,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1171. [2024-11-07 12:56:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 880 states have (on average 1.3272727272727274) internal successors, (1168), 892 states have internal predecessors, (1168), 218 states have call successors, (218), 74 states have call predecessors, (218), 72 states have return successors, (215), 213 states have call predecessors, (215), 208 states have call successors, (215) [2024-11-07 12:56:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1601 transitions. [2024-11-07 12:56:40,366 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1601 transitions. Word has length 53 [2024-11-07 12:56:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:40,367 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1601 transitions. [2024-11-07 12:56:40,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 12:56:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1601 transitions. [2024-11-07 12:56:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 12:56:40,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:40,374 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-07 12:56:40,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 12:56:40,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:40,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 945090840, now seen corresponding path program 1 times [2024-11-07 12:56:40,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:40,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633660909] [2024-11-07 12:56:40,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:40,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 12:56:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-07 12:56:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:56:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-07 12:56:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 12:56:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 12:56:40,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633660909] [2024-11-07 12:56:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633660909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:40,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:40,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 12:56:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831439666] [2024-11-07 12:56:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:40,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 12:56:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:40,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 12:56:40,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:56:40,904 INFO L87 Difference]: Start difference. First operand 1171 states and 1601 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 12:56:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:43,749 INFO L93 Difference]: Finished difference Result 1438 states and 1968 transitions. [2024-11-07 12:56:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 12:56:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2024-11-07 12:56:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:43,756 INFO L225 Difference]: With dead ends: 1438 [2024-11-07 12:56:43,756 INFO L226 Difference]: Without dead ends: 1190 [2024-11-07 12:56:43,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:56:43,757 INFO L432 NwaCegarLoop]: 680 mSDtfsCounter, 609 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:43,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 3292 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 12:56:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-07 12:56:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1161. [2024-11-07 12:56:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 871 states have (on average 1.3295063145809414) internal successors, (1158), 886 states have internal predecessors, (1158), 218 states have call successors, (218), 74 states have call predecessors, (218), 71 states have return successors, (211), 209 states have call predecessors, (211), 208 states have call successors, (211) [2024-11-07 12:56:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1587 transitions. [2024-11-07 12:56:43,820 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1587 transitions. Word has length 60 [2024-11-07 12:56:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:43,821 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1587 transitions. [2024-11-07 12:56:43,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 12:56:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1587 transitions. [2024-11-07 12:56:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 12:56:43,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:43,827 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:43,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 12:56:43,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash -254305111, now seen corresponding path program 1 times [2024-11-07 12:56:43,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:43,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183500938] [2024-11-07 12:56:43,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:43,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:56:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:56:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 12:56:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 12:56:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 12:56:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 12:56:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 12:56:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:44,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183500938] [2024-11-07 12:56:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183500938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 12:56:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010615490] [2024-11-07 12:56:44,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:44,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 12:56:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:44,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 12:56:44,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 12:56:44,120 INFO L87 Difference]: Start difference. First operand 1161 states and 1587 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 12:56:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:47,318 INFO L93 Difference]: Finished difference Result 2354 states and 3223 transitions. [2024-11-07 12:56:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 12:56:47,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-11-07 12:56:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:47,327 INFO L225 Difference]: With dead ends: 2354 [2024-11-07 12:56:47,327 INFO L226 Difference]: Without dead ends: 1198 [2024-11-07 12:56:47,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:56:47,332 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 486 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:47,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2702 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 12:56:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-07 12:56:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1164. [2024-11-07 12:56:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 873 states have (on average 1.3276059564719358) internal successors, (1159), 888 states have internal predecessors, (1159), 219 states have call successors, (219), 74 states have call predecessors, (219), 71 states have return successors, (212), 210 states have call predecessors, (212), 209 states have call successors, (212) [2024-11-07 12:56:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1590 transitions. [2024-11-07 12:56:47,412 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1590 transitions. Word has length 75 [2024-11-07 12:56:47,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:47,413 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1590 transitions. [2024-11-07 12:56:47,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-07 12:56:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1590 transitions. [2024-11-07 12:56:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 12:56:47,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:47,418 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 12:56:47,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1639220495, now seen corresponding path program 1 times [2024-11-07 12:56:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248375991] [2024-11-07 12:56:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:56:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:56:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:56:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:56:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:56:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:56:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:56:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:56:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-07 12:56:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:47,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248375991] [2024-11-07 12:56:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248375991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 12:56:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025484452] [2024-11-07 12:56:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:47,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 12:56:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 12:56:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:56:47,904 INFO L87 Difference]: Start difference. First operand 1164 states and 1590 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 12:56:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:51,250 INFO L93 Difference]: Finished difference Result 2333 states and 3191 transitions. [2024-11-07 12:56:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 12:56:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 89 [2024-11-07 12:56:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:51,255 INFO L225 Difference]: With dead ends: 2333 [2024-11-07 12:56:51,255 INFO L226 Difference]: Without dead ends: 1177 [2024-11-07 12:56:51,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:56:51,258 INFO L432 NwaCegarLoop]: 675 mSDtfsCounter, 489 mSDsluCounter, 3153 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 2655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:51,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 3828 Invalid, 2655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 12:56:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-11-07 12:56:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1142. [2024-11-07 12:56:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 852 states have (on average 1.323943661971831) internal successors, (1128), 866 states have internal predecessors, (1128), 218 states have call successors, (218), 74 states have call predecessors, (218), 71 states have return successors, (212), 210 states have call predecessors, (212), 209 states have call successors, (212) [2024-11-07 12:56:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1558 transitions. [2024-11-07 12:56:51,316 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1558 transitions. Word has length 89 [2024-11-07 12:56:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:51,316 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1558 transitions. [2024-11-07 12:56:51,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-07 12:56:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1558 transitions. [2024-11-07 12:56:51,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 12:56:51,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:51,321 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:51,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 12:56:51,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:51,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -846047142, now seen corresponding path program 1 times [2024-11-07 12:56:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:51,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045688165] [2024-11-07 12:56:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:56:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:56:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:56:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:56:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:56:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 12:56:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:56:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:56:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 12:56:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:51,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045688165] [2024-11-07 12:56:51,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045688165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 12:56:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917113267] [2024-11-07 12:56:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 12:56:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 12:56:51,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 12:56:51,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 12:56:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:52,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 12:56:52,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 12:56:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 12:56:52,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 12:56:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 12:56:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917113267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 12:56:52,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 12:56:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-11-07 12:56:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578486250] [2024-11-07 12:56:52,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 12:56:52,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 12:56:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 12:56:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:56:52,683 INFO L87 Difference]: Start difference. First operand 1142 states and 1558 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-07 12:56:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:56:55,397 INFO L93 Difference]: Finished difference Result 2467 states and 3399 transitions. [2024-11-07 12:56:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 12:56:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 91 [2024-11-07 12:56:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:56:55,406 INFO L225 Difference]: With dead ends: 2467 [2024-11-07 12:56:55,406 INFO L226 Difference]: Without dead ends: 1333 [2024-11-07 12:56:55,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:56:55,411 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 771 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 12:56:55,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 2191 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 12:56:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-11-07 12:56:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1260. [2024-11-07 12:56:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 958 states have (on average 1.3423799582463465) internal successors, (1286), 972 states have internal predecessors, (1286), 230 states have call successors, (230), 74 states have call predecessors, (230), 71 states have return successors, (224), 222 states have call predecessors, (224), 221 states have call successors, (224) [2024-11-07 12:56:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1740 transitions. [2024-11-07 12:56:55,470 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1740 transitions. Word has length 91 [2024-11-07 12:56:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:56:55,470 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1740 transitions. [2024-11-07 12:56:55,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-07 12:56:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1740 transitions. [2024-11-07 12:56:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 12:56:55,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:56:55,474 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:56:55,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 12:56:55,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 12:56:55,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:56:55,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:56:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2136353820, now seen corresponding path program 1 times [2024-11-07 12:56:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:56:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638412424] [2024-11-07 12:56:55,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:56:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:56:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:56:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:56:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:56:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:56:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:56:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:56:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:56:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:56:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:56:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:56:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 12:56:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:56:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-07 12:56:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:56:56,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638412424] [2024-11-07 12:56:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638412424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:56:56,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:56:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 12:56:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073579557] [2024-11-07 12:56:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:56:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 12:56:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:56:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 12:56:56,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:56:56,202 INFO L87 Difference]: Start difference. First operand 1260 states and 1740 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 12:57:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:57:00,533 INFO L93 Difference]: Finished difference Result 1315 states and 1817 transitions. [2024-11-07 12:57:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 12:57:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-11-07 12:57:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:57:00,542 INFO L225 Difference]: With dead ends: 1315 [2024-11-07 12:57:00,542 INFO L226 Difference]: Without dead ends: 1302 [2024-11-07 12:57:00,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 12:57:00,544 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 509 mSDsluCounter, 4243 mSDsCounter, 0 mSdLazyCounter, 3210 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 4915 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 3210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 12:57:00,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 4915 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 3210 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 12:57:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-11-07 12:57:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1263. [2024-11-07 12:57:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 960 states have (on average 1.3416666666666666) internal successors, (1288), 974 states have internal predecessors, (1288), 231 states have call successors, (231), 74 states have call predecessors, (231), 71 states have return successors, (225), 223 states have call predecessors, (225), 222 states have call successors, (225) [2024-11-07 12:57:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1744 transitions. [2024-11-07 12:57:00,607 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1744 transitions. Word has length 100 [2024-11-07 12:57:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:57:00,607 INFO L471 AbstractCegarLoop]: Abstraction has 1263 states and 1744 transitions. [2024-11-07 12:57:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 12:57:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1744 transitions. [2024-11-07 12:57:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 12:57:00,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:57:00,612 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:57:00,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 12:57:00,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:57:00,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:57:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2007044835, now seen corresponding path program 1 times [2024-11-07 12:57:00,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:57:00,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482125759] [2024-11-07 12:57:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:57:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:57:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:57:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:57:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:57:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:57:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:57:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:57:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:57:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:57:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:01,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:57:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 12:57:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-07 12:57:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:57:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482125759] [2024-11-07 12:57:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482125759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:57:01,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:57:01,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 12:57:01,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202772812] [2024-11-07 12:57:01,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:57:01,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 12:57:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:57:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 12:57:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:57:01,018 INFO L87 Difference]: Start difference. First operand 1263 states and 1744 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 12:57:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:57:04,623 INFO L93 Difference]: Finished difference Result 2550 states and 3530 transitions. [2024-11-07 12:57:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 12:57:04,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-11-07 12:57:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:57:04,630 INFO L225 Difference]: With dead ends: 2550 [2024-11-07 12:57:04,630 INFO L226 Difference]: Without dead ends: 1295 [2024-11-07 12:57:04,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:57:04,635 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 508 mSDsluCounter, 3124 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3797 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-07 12:57:04,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3797 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-07 12:57:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-07 12:57:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1261. [2024-11-07 12:57:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 959 states have (on average 1.340980187695516) internal successors, (1286), 973 states have internal predecessors, (1286), 230 states have call successors, (230), 74 states have call predecessors, (230), 71 states have return successors, (224), 222 states have call predecessors, (224), 221 states have call successors, (224) [2024-11-07 12:57:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1740 transitions. [2024-11-07 12:57:04,696 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1740 transitions. Word has length 102 [2024-11-07 12:57:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:57:04,696 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1740 transitions. [2024-11-07 12:57:04,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 12:57:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1740 transitions. [2024-11-07 12:57:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 12:57:04,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:57:04,703 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:57:04,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 12:57:04,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:57:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:57:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1755839994, now seen corresponding path program 1 times [2024-11-07 12:57:04,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:57:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885963728] [2024-11-07 12:57:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:57:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:57:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:57:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:57:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:57:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:57:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:57:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:57:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:57:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:57:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 12:57:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 12:57:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 12:57:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 12:57:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-07 12:57:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:57:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885963728] [2024-11-07 12:57:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885963728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 12:57:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711598756] [2024-11-07 12:57:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:57:05,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 12:57:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 12:57:05,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 12:57:05,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 12:57:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 12:57:06,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 12:57:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 12:57:06,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 12:57:06,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711598756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:57:06,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 12:57:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2024-11-07 12:57:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532078369] [2024-11-07 12:57:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:57:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 12:57:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:57:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 12:57:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:57:06,084 INFO L87 Difference]: Start difference. First operand 1261 states and 1740 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 12:57:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:57:06,203 INFO L93 Difference]: Finished difference Result 2518 states and 3476 transitions. [2024-11-07 12:57:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 12:57:06,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 124 [2024-11-07 12:57:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:57:06,216 INFO L225 Difference]: With dead ends: 2518 [2024-11-07 12:57:06,217 INFO L226 Difference]: Without dead ends: 1253 [2024-11-07 12:57:06,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:57:06,222 INFO L432 NwaCegarLoop]: 982 mSDtfsCounter, 3 mSDsluCounter, 5868 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6850 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:57:06,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6850 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 12:57:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-07 12:57:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1253. [2024-11-07 12:57:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 953 states have (on average 1.3389296956977965) internal successors, (1276), 968 states have internal predecessors, (1276), 228 states have call successors, (228), 74 states have call predecessors, (228), 71 states have return successors, (221), 219 states have call predecessors, (221), 219 states have call successors, (221) [2024-11-07 12:57:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1725 transitions. [2024-11-07 12:57:06,314 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1725 transitions. Word has length 124 [2024-11-07 12:57:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:57:06,315 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1725 transitions. [2024-11-07 12:57:06,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 12:57:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1725 transitions. [2024-11-07 12:57:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-07 12:57:06,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:57:06,323 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:57:06,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 12:57:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 12:57:06,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:57:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:57:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1050214026, now seen corresponding path program 1 times [2024-11-07 12:57:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:57:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117902111] [2024-11-07 12:57:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:57:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:57:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:57:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:57:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:57:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:57:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:57:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:57:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:57:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:57:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:57:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:57:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 12:57:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 12:57:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 12:57:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-07 12:57:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-07 12:57:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-07 12:57:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-07 12:57:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:57:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117902111] [2024-11-07 12:57:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117902111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:57:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:57:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 12:57:06,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675891469] [2024-11-07 12:57:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:57:06,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 12:57:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:57:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 12:57:06,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 12:57:06,876 INFO L87 Difference]: Start difference. First operand 1253 states and 1725 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 12:57:07,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 12:57:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:57:10,311 INFO L93 Difference]: Finished difference Result 2532 states and 3516 transitions. [2024-11-07 12:57:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 12:57:10,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 164 [2024-11-07 12:57:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:57:10,319 INFO L225 Difference]: With dead ends: 2532 [2024-11-07 12:57:10,319 INFO L226 Difference]: Without dead ends: 1287 [2024-11-07 12:57:10,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 12:57:10,323 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 480 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-07 12:57:10,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 2134 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-07 12:57:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-07 12:57:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1253. [2024-11-07 12:57:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 953 states have (on average 1.3326337880377754) internal successors, (1270), 968 states have internal predecessors, (1270), 228 states have call successors, (228), 74 states have call predecessors, (228), 71 states have return successors, (221), 219 states have call predecessors, (221), 219 states have call successors, (221) [2024-11-07 12:57:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1719 transitions. [2024-11-07 12:57:10,382 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1719 transitions. Word has length 164 [2024-11-07 12:57:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:57:10,382 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1719 transitions. [2024-11-07 12:57:10,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 12:57:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1719 transitions. [2024-11-07 12:57:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 12:57:10,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:57:10,389 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:57:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 12:57:10,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:57:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:57:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash -223110231, now seen corresponding path program 1 times [2024-11-07 12:57:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:57:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889331752] [2024-11-07 12:57:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:57:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:57:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:57:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:57:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:57:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:57:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:57:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:57:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:57:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:57:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:57:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:57:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 12:57:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 12:57:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 12:57:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 12:57:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 12:57:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 12:57:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-07 12:57:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:57:10,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889331752] [2024-11-07 12:57:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889331752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:57:10,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:57:10,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 12:57:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148907849] [2024-11-07 12:57:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:57:10,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 12:57:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:57:10,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 12:57:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:57:10,875 INFO L87 Difference]: Start difference. First operand 1253 states and 1719 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 12:57:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:57:14,441 INFO L93 Difference]: Finished difference Result 1362 states and 1860 transitions. [2024-11-07 12:57:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 12:57:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 167 [2024-11-07 12:57:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:57:14,449 INFO L225 Difference]: With dead ends: 1362 [2024-11-07 12:57:14,449 INFO L226 Difference]: Without dead ends: 1131 [2024-11-07 12:57:14,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:57:14,453 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 478 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 3823 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-07 12:57:14,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 3823 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-07 12:57:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-07 12:57:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1104. [2024-11-07 12:57:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 847 states have (on average 1.3412042502951593) internal successors, (1136), 861 states have internal predecessors, (1136), 194 states have call successors, (194), 64 states have call predecessors, (194), 62 states have return successors, (189), 187 states have call predecessors, (189), 187 states have call successors, (189) [2024-11-07 12:57:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1519 transitions. [2024-11-07 12:57:14,511 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1519 transitions. Word has length 167 [2024-11-07 12:57:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:57:14,512 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1519 transitions. [2024-11-07 12:57:14,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 12:57:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1519 transitions. [2024-11-07 12:57:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 12:57:14,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 12:57:14,519 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:57:14,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 12:57:14,520 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 12:57:14,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 12:57:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1316596252, now seen corresponding path program 1 times [2024-11-07 12:57:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 12:57:14,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900411713] [2024-11-07 12:57:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 12:57:14,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 12:57:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 12:57:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 12:57:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-07 12:57:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 12:57:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 12:57:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 12:57:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 12:57:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 12:57:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 12:57:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 12:57:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 12:57:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 12:57:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 12:57:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 12:57:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 12:57:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 12:57:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 12:57:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-07 12:57:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 12:57:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 12:57:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-07 12:57:14,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 12:57:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900411713] [2024-11-07 12:57:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900411713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 12:57:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 12:57:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 12:57:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927071778] [2024-11-07 12:57:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 12:57:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 12:57:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 12:57:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 12:57:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 12:57:14,976 INFO L87 Difference]: Start difference. First operand 1104 states and 1519 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 12:57:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 12:57:18,234 INFO L93 Difference]: Finished difference Result 1241 states and 1694 transitions. [2024-11-07 12:57:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 12:57:18,235 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 176 [2024-11-07 12:57:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 12:57:18,237 INFO L225 Difference]: With dead ends: 1241 [2024-11-07 12:57:18,237 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 12:57:18,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 12:57:18,241 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 475 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 3709 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-07 12:57:18,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 3709 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-07 12:57:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 12:57:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 12:57:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 12:57:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 12:57:18,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2024-11-07 12:57:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 12:57:18,244 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 12:57:18,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 12:57:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 12:57:18,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 12:57:18,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 12:57:18,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 12:57:18,251 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 12:57:18,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.