./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.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 9e6cb9575d01b247a38f631016ebb8c3cacd422c61aaebbf8be9e6e4657d498f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:54:41,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:54:41,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:54:41,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:54:41,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:54:41,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:54:41,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:54:41,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:54:41,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:54:41,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:54:41,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:54:41,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:54:41,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:54:41,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:54:41,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:54:41,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:54:41,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:54:41,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:54:41,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:54:41,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:54:41,617 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 -> 9e6cb9575d01b247a38f631016ebb8c3cacd422c61aaebbf8be9e6e4657d498f [2025-01-09 18:54:41,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:54:41,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:54:41,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:54:41,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:54:41,876 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:54:41,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i [2025-01-09 18:54:43,073 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02070f96/ddf834a3a66348a08a58cea88e1f87b9/FLAGf38724be6 [2025-01-09 18:54:43,537 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:54:43,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i [2025-01-09 18:54:43,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02070f96/ddf834a3a66348a08a58cea88e1f87b9/FLAGf38724be6 [2025-01-09 18:54:43,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02070f96/ddf834a3a66348a08a58cea88e1f87b9 [2025-01-09 18:54:43,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:54:43,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:54:43,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:54:43,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:54:43,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:54:43,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:54:43" (1/1) ... [2025-01-09 18:54:43,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a964a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:43, skipping insertion in model container [2025-01-09 18:54:43,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:54:43" (1/1) ... [2025-01-09 18:54:43,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:54:44,873 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i[172920,172933] [2025-01-09 18:54:44,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:54:44,983 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:54:45,162 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i[172920,172933] [2025-01-09 18:54:45,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:54:45,231 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:54:45,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45 WrapperNode [2025-01-09 18:54:45,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:54:45,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:54:45,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:54:45,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:54:45,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,395 INFO L138 Inliner]: procedures = 264, calls = 938, calls flagged for inlining = 102, calls inlined = 94, statements flattened = 2485 [2025-01-09 18:54:45,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:54:45,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:54:45,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:54:45,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:54:45,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,590 INFO L175 MemorySlicer]: Split 318 memory accesses to 13 slices as follows [2, 2, 9, 8, 8, 2, 4, 22, 7, 7, 235, 4, 8]. 74 percent of accesses are in the largest equivalence class. The 44 initializations are split as follows [2, 0, 0, 8, 8, 0, 4, 0, 0, 0, 10, 4, 8]. The 171 writes are split as follows [0, 1, 1, 0, 0, 1, 0, 22, 6, 5, 135, 0, 0]. [2025-01-09 18:54:45,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:54:45,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:54:45,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:54:45,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:54:45,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (1/1) ... [2025-01-09 18:54:45,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:54:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:54:45,759 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) [2025-01-09 18:54:45,765 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 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_read [2025-01-09 18:54:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_read [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:54:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:54:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure spi_sync [2025-01-09 18:54:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_sync [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:54:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:54:45,785 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2025-01-09 18:54:45,785 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure usleep_range [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure usleep_range [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure of_property_read_u32 [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure of_property_read_u32 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_tsc2005 [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_tsc2005 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_3 [2025-01-09 18:54:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_3 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-01-09 18:54:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-01-09 18:54:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-01-09 18:54:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-01-09 18:54:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-01-09 18:54:45,787 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-01-09 18:54:45,788 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-01-09 18:54:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_irq_2 [2025-01-09 18:54:45,788 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_irq_2 [2025-01-09 18:54:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:54:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:54:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:54:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:54:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-01-09 18:54:45,790 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-01-09 18:54:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_4 [2025-01-09 18:54:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_4 [2025-01-09 18:54:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_tsc2005 [2025-01-09 18:54:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_tsc2005 [2025-01-09 18:54:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:54:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-01-09 18:54:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-01-09 18:54:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-01-09 18:54:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:54:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:54:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:54:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 18:54:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 18:54:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_stop_scan [2025-01-09 18:54:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_stop_scan [2025-01-09 18:54:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_write [2025-01-09 18:54:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_write [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_cmd [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_cmd [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_add_tail [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_add_tail [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_esd_work [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_esd_work [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure to_spi_device [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure to_spi_device [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_suspend [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_suspend [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-01-09 18:54:45,794 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-01-09 18:54:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure devm_request_threaded_irq [2025-01-09 18:54:45,795 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_request_threaded_irq [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:54:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:54:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:54:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 18:54:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 18:54:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2025-01-09 18:54:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2025-01-09 18:54:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure sysfs_remove_group [2025-01-09 18:54:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure sysfs_remove_group [2025-01-09 18:54:45,798 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_disable [2025-01-09 18:54:45,798 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_disable [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure reg_check_2 [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_check_2 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_timer_4 [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_timer_4 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_start_scan [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_start_scan [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_resume [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_resume [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_4 [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_4 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2025-01-09 18:54:45,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-01-09 18:54:45,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_init [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_init [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_2 [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_2 [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_setup_read [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_setup_read [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure __tsc2005_enable [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __tsc2005_enable [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure spi_get_drvdata [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_get_drvdata [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_tsc2005 [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_tsc2005 [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_irq_thread [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_irq_thread [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure __tsc2005_disable [2025-01-09 18:54:45,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __tsc2005_disable [2025-01-09 18:54:45,800 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_update_pen_state [2025-01-09 18:54:45,801 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_update_pen_state [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2025-01-09 18:54:45,801 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2025-01-09 18:54:45,801 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure tsc2005_set_reset [2025-01-09 18:54:45,801 INFO L138 BoogieDeclarations]: Found implementation of procedure tsc2005_set_reset [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-01-09 18:54:45,801 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:54:45,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:54:45,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:54:45,802 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:54:45,802 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:54:46,236 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:54:46,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:54:46,310 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:55:00,456 INFO L? ?]: Removed 1116 outVars from TransFormulas that were not future-live. [2025-01-09 18:55:00,457 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:55:00,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:55:00,491 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 18:55:00,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:00 BoogieIcfgContainer [2025-01-09 18:55:00,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:55:00,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:55:00,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:55:00,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:55:00,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:54:43" (1/3) ... [2025-01-09 18:55:00,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433821e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:00, skipping insertion in model container [2025-01-09 18:55:00,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:54:45" (2/3) ... [2025-01-09 18:55:00,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433821e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:55:00, skipping insertion in model container [2025-01-09 18:55:00,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:55:00" (3/3) ... [2025-01-09 18:55:00,507 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i [2025-01-09 18:55:00,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:55:00,523 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--touchscreen--tsc2005.ko-entry_point.cil.out.i that has 81 procedures, 1000 locations, 1 initial locations, 15 loop locations, and 1 error locations. [2025-01-09 18:55:00,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:55:00,613 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;@11b3e405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:55:00,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:55:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 955 states, 675 states have (on average 1.3866666666666667) internal successors, (936), 706 states have internal predecessors, (936), 210 states have call successors, (210), 69 states have call predecessors, (210), 68 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2025-01-09 18:55:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 18:55:00,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:00,632 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:00,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash -495234538, now seen corresponding path program 1 times [2025-01-09 18:55:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010960460] [2025-01-09 18:55:00,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:00,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 18:55:01,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 18:55:01,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:01,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 18:55:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010960460] [2025-01-09 18:55:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010960460] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:55:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056447386] [2025-01-09 18:55:01,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:01,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:55:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:55:01,347 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) [2025-01-09 18:55:01,350 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 [2025-01-09 18:55:01,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 18:55:02,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 18:55:02,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:02,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:02,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1645 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 18:55:02,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:55:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 18:55:02,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:55:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056447386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:55:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 18:55:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283758096] [2025-01-09 18:55:02,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:02,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 18:55:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:02,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 18:55:02,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:55:02,127 INFO L87 Difference]: Start difference. First operand has 955 states, 675 states have (on average 1.3866666666666667) internal successors, (936), 706 states have internal predecessors, (936), 210 states have call successors, (210), 69 states have call predecessors, (210), 68 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 18:55:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:02,221 INFO L93 Difference]: Finished difference Result 1905 states and 2728 transitions. [2025-01-09 18:55:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 18:55:02,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-01-09 18:55:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:02,233 INFO L225 Difference]: With dead ends: 1905 [2025-01-09 18:55:02,233 INFO L226 Difference]: Without dead ends: 936 [2025-01-09 18:55:02,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:55:02,241 INFO L435 NwaCegarLoop]: 1330 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:02,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-01-09 18:55:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2025-01-09 18:55:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 670 states have (on average 1.3611940298507463) internal successors, (912), 687 states have internal predecessors, (912), 198 states have call successors, (198), 68 states have call predecessors, (198), 67 states have return successors, (191), 187 states have call predecessors, (191), 191 states have call successors, (191) [2025-01-09 18:55:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1301 transitions. [2025-01-09 18:55:02,302 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1301 transitions. Word has length 111 [2025-01-09 18:55:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1301 transitions. [2025-01-09 18:55:02,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 18:55:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1301 transitions. [2025-01-09 18:55:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 18:55:02,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:02,306 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:02,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:55:02,510 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,SelfDestructingSolverStorable0 [2025-01-09 18:55:02,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:02,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:02,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1394440059, now seen corresponding path program 1 times [2025-01-09 18:55:02,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:02,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262849568] [2025-01-09 18:55:02,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:02,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 18:55:02,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 18:55:02,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:02,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262849568] [2025-01-09 18:55:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262849568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:03,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713524823] [2025-01-09 18:55:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:03,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:03,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:03,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:03,177 INFO L87 Difference]: Start difference. First operand 936 states and 1301 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:03,325 INFO L93 Difference]: Finished difference Result 2761 states and 3869 transitions. [2025-01-09 18:55:03,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:03,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 112 [2025-01-09 18:55:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:03,338 INFO L225 Difference]: With dead ends: 2761 [2025-01-09 18:55:03,340 INFO L226 Difference]: Without dead ends: 1847 [2025-01-09 18:55:03,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:03,345 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 1281 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:03,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 2576 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-01-09 18:55:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1829. [2025-01-09 18:55:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1313 states have (on average 1.3617669459253618) internal successors, (1788), 1341 states have internal predecessors, (1788), 382 states have call successors, (382), 134 states have call predecessors, (382), 133 states have return successors, (386), 367 states have call predecessors, (386), 375 states have call successors, (386) [2025-01-09 18:55:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2556 transitions. [2025-01-09 18:55:03,446 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2556 transitions. Word has length 112 [2025-01-09 18:55:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2556 transitions. [2025-01-09 18:55:03,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2556 transitions. [2025-01-09 18:55:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 18:55:03,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:03,457 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:55:03,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -129996302, now seen corresponding path program 1 times [2025-01-09 18:55:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842780558] [2025-01-09 18:55:03,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 18:55:03,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 18:55:03,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:03,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842780558] [2025-01-09 18:55:03,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842780558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:03,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:03,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304264756] [2025-01-09 18:55:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:03,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:03,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:03,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:03,905 INFO L87 Difference]: Start difference. First operand 1829 states and 2556 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:04,040 INFO L93 Difference]: Finished difference Result 4530 states and 6363 transitions. [2025-01-09 18:55:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 110 [2025-01-09 18:55:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:04,061 INFO L225 Difference]: With dead ends: 4530 [2025-01-09 18:55:04,061 INFO L226 Difference]: Without dead ends: 2723 [2025-01-09 18:55:04,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:04,070 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 1259 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:04,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 2576 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2723 states. [2025-01-09 18:55:04,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2723 to 2705. [2025-01-09 18:55:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 1943 states have (on average 1.3623262995367988) internal successors, (2647), 1984 states have internal predecessors, (2647), 565 states have call successors, (565), 200 states have call predecessors, (565), 196 states have return successors, (574), 541 states have call predecessors, (574), 558 states have call successors, (574) [2025-01-09 18:55:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3786 transitions. [2025-01-09 18:55:04,211 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3786 transitions. Word has length 110 [2025-01-09 18:55:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:04,212 INFO L471 AbstractCegarLoop]: Abstraction has 2705 states and 3786 transitions. [2025-01-09 18:55:04,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3786 transitions. [2025-01-09 18:55:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 18:55:04,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:04,214 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:55:04,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:04,214 INFO L85 PathProgramCache]: Analyzing trace with hash -9636363, now seen corresponding path program 1 times [2025-01-09 18:55:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428522061] [2025-01-09 18:55:04,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:04,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 18:55:04,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 18:55:04,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:04,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:04,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:04,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428522061] [2025-01-09 18:55:04,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428522061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:04,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:04,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:04,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875549188] [2025-01-09 18:55:04,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:04,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:04,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:04,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:04,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:04,634 INFO L87 Difference]: Start difference. First operand 2705 states and 3786 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:04,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:04,791 INFO L93 Difference]: Finished difference Result 6297 states and 8845 transitions. [2025-01-09 18:55:04,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:04,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 113 [2025-01-09 18:55:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:04,812 INFO L225 Difference]: With dead ends: 6297 [2025-01-09 18:55:04,813 INFO L226 Difference]: Without dead ends: 3614 [2025-01-09 18:55:04,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:04,824 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 1282 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:04,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 2569 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3614 states. [2025-01-09 18:55:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3614 to 3596. [2025-01-09 18:55:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3596 states, 2586 states have (on average 1.3611755607115237) internal successors, (3520), 2637 states have internal predecessors, (3520), 747 states have call successors, (747), 266 states have call predecessors, (747), 262 states have return successors, (766), 720 states have call predecessors, (766), 740 states have call successors, (766) [2025-01-09 18:55:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3596 states to 3596 states and 5033 transitions. [2025-01-09 18:55:04,956 INFO L78 Accepts]: Start accepts. Automaton has 3596 states and 5033 transitions. Word has length 113 [2025-01-09 18:55:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:04,957 INFO L471 AbstractCegarLoop]: Abstraction has 3596 states and 5033 transitions. [2025-01-09 18:55:04,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3596 states and 5033 transitions. [2025-01-09 18:55:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 18:55:04,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:04,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:04,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:55:04,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1621044684, now seen corresponding path program 1 times [2025-01-09 18:55:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895700229] [2025-01-09 18:55:04,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:05,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 18:55:05,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 18:55:05,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:05,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895700229] [2025-01-09 18:55:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895700229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:05,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391906962] [2025-01-09 18:55:05,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:05,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:05,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:05,469 INFO L87 Difference]: Start difference. First operand 3596 states and 5033 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:05,641 INFO L93 Difference]: Finished difference Result 8017 states and 11238 transitions. [2025-01-09 18:55:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:05,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 111 [2025-01-09 18:55:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:05,666 INFO L225 Difference]: With dead ends: 8017 [2025-01-09 18:55:05,667 INFO L226 Difference]: Without dead ends: 4443 [2025-01-09 18:55:05,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:05,681 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 1270 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:05,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2579 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2025-01-09 18:55:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4425. [2025-01-09 18:55:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4425 states, 3190 states have (on average 1.361128526645768) internal successors, (4342), 3250 states have internal predecessors, (4342), 909 states have call successors, (909), 328 states have call predecessors, (909), 325 states have return successors, (937), 880 states have call predecessors, (937), 902 states have call successors, (937) [2025-01-09 18:55:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4425 states to 4425 states and 6188 transitions. [2025-01-09 18:55:05,840 INFO L78 Accepts]: Start accepts. Automaton has 4425 states and 6188 transitions. Word has length 111 [2025-01-09 18:55:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:05,840 INFO L471 AbstractCegarLoop]: Abstraction has 4425 states and 6188 transitions. [2025-01-09 18:55:05,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:55:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4425 states and 6188 transitions. [2025-01-09 18:55:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 18:55:05,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:05,842 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:05,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:55:05,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:05,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2133296790, now seen corresponding path program 1 times [2025-01-09 18:55:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543452613] [2025-01-09 18:55:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:06,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 18:55:06,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 18:55:06,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:06,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:06,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:06,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543452613] [2025-01-09 18:55:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543452613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:06,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117137608] [2025-01-09 18:55:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:06,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:06,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:06,189 INFO L87 Difference]: Start difference. First operand 4425 states and 6188 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 18:55:10,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:10,478 INFO L93 Difference]: Finished difference Result 13118 states and 18371 transitions. [2025-01-09 18:55:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2025-01-09 18:55:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:10,521 INFO L225 Difference]: With dead ends: 13118 [2025-01-09 18:55:10,521 INFO L226 Difference]: Without dead ends: 8715 [2025-01-09 18:55:10,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:10,535 INFO L435 NwaCegarLoop]: 1302 mSDtfsCounter, 1222 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:10,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2588 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:55:10,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2025-01-09 18:55:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 8710. [2025-01-09 18:55:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8710 states, 6285 states have (on average 1.3618138424821002) internal successors, (8559), 6399 states have internal predecessors, (8559), 1785 states have call successors, (1785), 644 states have call predecessors, (1785), 639 states have return successors, (1848), 1734 states have call predecessors, (1848), 1778 states have call successors, (1848) [2025-01-09 18:55:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8710 states to 8710 states and 12192 transitions. [2025-01-09 18:55:10,814 INFO L78 Accepts]: Start accepts. Automaton has 8710 states and 12192 transitions. Word has length 111 [2025-01-09 18:55:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:10,814 INFO L471 AbstractCegarLoop]: Abstraction has 8710 states and 12192 transitions. [2025-01-09 18:55:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-01-09 18:55:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8710 states and 12192 transitions. [2025-01-09 18:55:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 18:55:10,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:10,816 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:55:10,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:10,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2036796155, now seen corresponding path program 1 times [2025-01-09 18:55:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:10,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121322072] [2025-01-09 18:55:10,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:11,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 18:55:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 18:55:11,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:11,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:11,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121322072] [2025-01-09 18:55:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121322072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773915973] [2025-01-09 18:55:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:11,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:11,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:11,239 INFO L87 Difference]: Start difference. First operand 8710 states and 12192 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:11,452 INFO L93 Difference]: Finished difference Result 8712 states and 12193 transitions. [2025-01-09 18:55:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:11,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2025-01-09 18:55:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:11,492 INFO L225 Difference]: With dead ends: 8712 [2025-01-09 18:55:11,492 INFO L226 Difference]: Without dead ends: 8709 [2025-01-09 18:55:11,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:11,499 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 1264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:11,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 1298 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2025-01-09 18:55:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 8709. [2025-01-09 18:55:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8709 states, 6285 states have (on average 1.3616547334924423) internal successors, (8558), 6398 states have internal predecessors, (8558), 1784 states have call successors, (1784), 644 states have call predecessors, (1784), 639 states have return successors, (1848), 1734 states have call predecessors, (1848), 1778 states have call successors, (1848) [2025-01-09 18:55:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 12190 transitions. [2025-01-09 18:55:11,828 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 12190 transitions. Word has length 112 [2025-01-09 18:55:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:11,829 INFO L471 AbstractCegarLoop]: Abstraction has 8709 states and 12190 transitions. [2025-01-09 18:55:11,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 12190 transitions. [2025-01-09 18:55:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 18:55:11,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:11,833 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:11,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:55:11,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:11,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1283573750, now seen corresponding path program 1 times [2025-01-09 18:55:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899313619] [2025-01-09 18:55:11,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:11,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:12,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 18:55:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 18:55:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:12,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899313619] [2025-01-09 18:55:12,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899313619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:12,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:12,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354646280] [2025-01-09 18:55:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:12,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:12,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:12,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:12,191 INFO L87 Difference]: Start difference. First operand 8709 states and 12190 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:12,459 INFO L93 Difference]: Finished difference Result 8711 states and 12191 transitions. [2025-01-09 18:55:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:12,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2025-01-09 18:55:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:12,497 INFO L225 Difference]: With dead ends: 8711 [2025-01-09 18:55:12,497 INFO L226 Difference]: Without dead ends: 8708 [2025-01-09 18:55:12,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:12,503 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 1261 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:12,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1296 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8708 states. [2025-01-09 18:55:12,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8708 to 8708. [2025-01-09 18:55:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8708 states, 6285 states have (on average 1.3614956245027845) internal successors, (8557), 6397 states have internal predecessors, (8557), 1783 states have call successors, (1783), 644 states have call predecessors, (1783), 639 states have return successors, (1848), 1734 states have call predecessors, (1848), 1778 states have call successors, (1848) [2025-01-09 18:55:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8708 states to 8708 states and 12188 transitions. [2025-01-09 18:55:12,930 INFO L78 Accepts]: Start accepts. Automaton has 8708 states and 12188 transitions. Word has length 113 [2025-01-09 18:55:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 8708 states and 12188 transitions. [2025-01-09 18:55:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8708 states and 12188 transitions. [2025-01-09 18:55:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 18:55:12,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:12,933 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:55:12,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1135830568, now seen corresponding path program 1 times [2025-01-09 18:55:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725246567] [2025-01-09 18:55:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:13,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 18:55:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 18:55:13,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:13,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:13,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:13,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725246567] [2025-01-09 18:55:13,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725246567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:13,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:13,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:13,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769555442] [2025-01-09 18:55:13,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:13,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:13,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:13,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:13,289 INFO L87 Difference]: Start difference. First operand 8708 states and 12188 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:13,444 INFO L93 Difference]: Finished difference Result 8710 states and 12189 transitions. [2025-01-09 18:55:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2025-01-09 18:55:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:13,478 INFO L225 Difference]: With dead ends: 8710 [2025-01-09 18:55:13,479 INFO L226 Difference]: Without dead ends: 8707 [2025-01-09 18:55:13,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:13,486 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 1258 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:13,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1294 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2025-01-09 18:55:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 8707. [2025-01-09 18:55:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8707 states, 6285 states have (on average 1.3613365155131265) internal successors, (8556), 6396 states have internal predecessors, (8556), 1782 states have call successors, (1782), 644 states have call predecessors, (1782), 639 states have return successors, (1848), 1734 states have call predecessors, (1848), 1778 states have call successors, (1848) [2025-01-09 18:55:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8707 states to 8707 states and 12186 transitions. [2025-01-09 18:55:13,758 INFO L78 Accepts]: Start accepts. Automaton has 8707 states and 12186 transitions. Word has length 114 [2025-01-09 18:55:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:13,759 INFO L471 AbstractCegarLoop]: Abstraction has 8707 states and 12186 transitions. [2025-01-09 18:55:13,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 8707 states and 12186 transitions. [2025-01-09 18:55:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 18:55:13,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:13,762 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:13,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:55:13,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:13,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 850764089, now seen corresponding path program 1 times [2025-01-09 18:55:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917276910] [2025-01-09 18:55:13,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:14,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 18:55:14,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 18:55:14,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:14,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917276910] [2025-01-09 18:55:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917276910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367108462] [2025-01-09 18:55:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:14,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:14,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:14,090 INFO L87 Difference]: Start difference. First operand 8707 states and 12186 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:14,429 INFO L93 Difference]: Finished difference Result 21892 states and 30751 transitions. [2025-01-09 18:55:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2025-01-09 18:55:14,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:14,487 INFO L225 Difference]: With dead ends: 21892 [2025-01-09 18:55:14,487 INFO L226 Difference]: Without dead ends: 14810 [2025-01-09 18:55:14,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:14,515 INFO L435 NwaCegarLoop]: 1478 mSDtfsCounter, 1117 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:14,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 2683 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14810 states. [2025-01-09 18:55:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14810 to 14779. [2025-01-09 18:55:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14779 states, 10732 states have (on average 1.3620014908684308) internal successors, (14617), 10963 states have internal predecessors, (14617), 2947 states have call successors, (2947), 1129 states have call predecessors, (2947), 1099 states have return successors, (3134), 2787 states have call predecessors, (3134), 2942 states have call successors, (3134) [2025-01-09 18:55:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14779 states to 14779 states and 20698 transitions. [2025-01-09 18:55:15,039 INFO L78 Accepts]: Start accepts. Automaton has 14779 states and 20698 transitions. Word has length 115 [2025-01-09 18:55:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 14779 states and 20698 transitions. [2025-01-09 18:55:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:55:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14779 states and 20698 transitions. [2025-01-09 18:55:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 18:55:15,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:15,044 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:15,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 18:55:15,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash -799518649, now seen corresponding path program 1 times [2025-01-09 18:55:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206612410] [2025-01-09 18:55:15,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 18:55:15,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 18:55:15,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:15,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 18:55:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206612410] [2025-01-09 18:55:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206612410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230771028] [2025-01-09 18:55:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:15,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:15,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:15,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:15,416 INFO L87 Difference]: Start difference. First operand 14779 states and 20698 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 18:55:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:16,641 INFO L93 Difference]: Finished difference Result 42360 states and 58716 transitions. [2025-01-09 18:55:16,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2025-01-09 18:55:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:16,788 INFO L225 Difference]: With dead ends: 42360 [2025-01-09 18:55:16,788 INFO L226 Difference]: Without dead ends: 27603 [2025-01-09 18:55:16,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:16,855 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 1081 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:16,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 2749 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:55:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27603 states. [2025-01-09 18:55:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27603 to 27566. [2025-01-09 18:55:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27566 states, 19810 states have (on average 1.3380111055022716) internal successors, (26506), 20210 states have internal predecessors, (26506), 5578 states have call successors, (5578), 2219 states have call predecessors, (5578), 2177 states have return successors, (5907), 5317 states have call predecessors, (5907), 5573 states have call successors, (5907) [2025-01-09 18:55:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27566 states to 27566 states and 37991 transitions. [2025-01-09 18:55:17,945 INFO L78 Accepts]: Start accepts. Automaton has 27566 states and 37991 transitions. Word has length 135 [2025-01-09 18:55:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:17,946 INFO L471 AbstractCegarLoop]: Abstraction has 27566 states and 37991 transitions. [2025-01-09 18:55:17,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 18:55:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 27566 states and 37991 transitions. [2025-01-09 18:55:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-09 18:55:17,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:17,952 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2025-01-09 18:55:17,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:55:17,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:17,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 751117211, now seen corresponding path program 1 times [2025-01-09 18:55:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695015276] [2025-01-09 18:55:17,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:18,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 18:55:18,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 18:55:18,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:18,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-01-09 18:55:18,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:18,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695015276] [2025-01-09 18:55:18,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695015276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:18,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:18,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:18,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742665888] [2025-01-09 18:55:18,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:18,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:18,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:18,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:18,293 INFO L87 Difference]: Start difference. First operand 27566 states and 37991 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:55:22,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:23,478 INFO L93 Difference]: Finished difference Result 68690 states and 94778 transitions. [2025-01-09 18:55:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 186 [2025-01-09 18:55:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:23,650 INFO L225 Difference]: With dead ends: 68690 [2025-01-09 18:55:23,650 INFO L226 Difference]: Without dead ends: 41146 [2025-01-09 18:55:23,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:23,734 INFO L435 NwaCegarLoop]: 2331 mSDtfsCounter, 1120 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:23,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3555 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:55:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41146 states. [2025-01-09 18:55:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41146 to 41109. [2025-01-09 18:55:25,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41109 states, 29644 states have (on average 1.3328498178383483) internal successors, (39511), 30213 states have internal predecessors, (39511), 8209 states have call successors, (8209), 3309 states have call predecessors, (8209), 3255 states have return successors, (8680), 7847 states have call predecessors, (8680), 8204 states have call successors, (8680) [2025-01-09 18:55:25,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41109 states to 41109 states and 56400 transitions. [2025-01-09 18:55:25,798 INFO L78 Accepts]: Start accepts. Automaton has 41109 states and 56400 transitions. Word has length 186 [2025-01-09 18:55:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:25,799 INFO L471 AbstractCegarLoop]: Abstraction has 41109 states and 56400 transitions. [2025-01-09 18:55:25,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 18:55:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 41109 states and 56400 transitions. [2025-01-09 18:55:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 18:55:25,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:25,806 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:25,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:55:25,806 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 180342716, now seen corresponding path program 1 times [2025-01-09 18:55:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025879659] [2025-01-09 18:55:25,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:25,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:25,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 18:55:26,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 18:55:26,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:26,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-01-09 18:55:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025879659] [2025-01-09 18:55:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025879659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:26,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501737071] [2025-01-09 18:55:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:26,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:26,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:26,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:26,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:26,160 INFO L87 Difference]: Start difference. First operand 41109 states and 56400 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:55:30,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:31,682 INFO L93 Difference]: Finished difference Result 77454 states and 106418 transitions. [2025-01-09 18:55:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:31,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 209 [2025-01-09 18:55:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:31,845 INFO L225 Difference]: With dead ends: 77454 [2025-01-09 18:55:31,845 INFO L226 Difference]: Without dead ends: 41111 [2025-01-09 18:55:31,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:31,926 INFO L435 NwaCegarLoop]: 2158 mSDtfsCounter, 1197 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:31,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 3289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:55:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41111 states. [2025-01-09 18:55:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41111 to 40726. [2025-01-09 18:55:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40726 states, 29423 states have (on average 1.3326989090167556) internal successors, (39212), 29982 states have internal predecessors, (39212), 8070 states have call successors, (8070), 3217 states have call predecessors, (8070), 3232 states have return successors, (8311), 7787 states have call predecessors, (8311), 8009 states have call successors, (8311) [2025-01-09 18:55:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40726 states to 40726 states and 55593 transitions. [2025-01-09 18:55:34,126 INFO L78 Accepts]: Start accepts. Automaton has 40726 states and 55593 transitions. Word has length 209 [2025-01-09 18:55:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:34,127 INFO L471 AbstractCegarLoop]: Abstraction has 40726 states and 55593 transitions. [2025-01-09 18:55:34,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 18:55:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40726 states and 55593 transitions. [2025-01-09 18:55:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-01-09 18:55:34,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:34,152 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:34,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:55:34,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:34,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1211247816, now seen corresponding path program 1 times [2025-01-09 18:55:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:34,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576808871] [2025-01-09 18:55:34,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:34,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-01-09 18:55:34,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-01-09 18:55:34,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:34,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2025-01-09 18:55:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576808871] [2025-01-09 18:55:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576808871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476098845] [2025-01-09 18:55:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:34,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:34,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:34,942 INFO L87 Difference]: Start difference. First operand 40726 states and 55593 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 18:55:38,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:55:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:40,516 INFO L93 Difference]: Finished difference Result 94903 states and 129761 transitions. [2025-01-09 18:55:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 439 [2025-01-09 18:55:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:40,870 INFO L225 Difference]: With dead ends: 94903 [2025-01-09 18:55:40,871 INFO L226 Difference]: Without dead ends: 54199 [2025-01-09 18:55:40,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:40,962 INFO L435 NwaCegarLoop]: 2382 mSDtfsCounter, 1149 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:40,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3575 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 18:55:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54199 states. [2025-01-09 18:55:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54199 to 54145. [2025-01-09 18:55:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54145 states, 39185 states have (on average 1.3300752839096592) internal successors, (52119), 39909 states have internal predecessors, (52119), 10657 states have call successors, (10657), 4275 states have call predecessors, (10657), 4302 states have return successors, (10988), 10301 states have call predecessors, (10988), 10596 states have call successors, (10988) [2025-01-09 18:55:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54145 states to 54145 states and 73764 transitions. [2025-01-09 18:55:43,411 INFO L78 Accepts]: Start accepts. Automaton has 54145 states and 73764 transitions. Word has length 439 [2025-01-09 18:55:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 54145 states and 73764 transitions. [2025-01-09 18:55:43,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 18:55:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 54145 states and 73764 transitions. [2025-01-09 18:55:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-01-09 18:55:43,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:43,438 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:43,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:55:43,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:43,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2049294054, now seen corresponding path program 1 times [2025-01-09 18:55:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:43,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287589031] [2025-01-09 18:55:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:55:43,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-01-09 18:55:43,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-01-09 18:55:43,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:55:43,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:55:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-01-09 18:55:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:55:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287589031] [2025-01-09 18:55:44,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287589031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:55:44,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:55:44,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:55:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495213170] [2025-01-09 18:55:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:55:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:55:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:55:44,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:55:44,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:44,127 INFO L87 Difference]: Start difference. First operand 54145 states and 73764 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 18:55:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:55:48,229 INFO L93 Difference]: Finished difference Result 158059 states and 215120 transitions. [2025-01-09 18:55:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:55:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 482 [2025-01-09 18:55:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:55:48,714 INFO L225 Difference]: With dead ends: 158059 [2025-01-09 18:55:48,714 INFO L226 Difference]: Without dead ends: 103936 [2025-01-09 18:55:48,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:55:48,826 INFO L435 NwaCegarLoop]: 1819 mSDtfsCounter, 1202 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:55:48,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 3080 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:55:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103936 states. [2025-01-09 18:55:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103936 to 103880. [2025-01-09 18:55:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103880 states, 75555 states have (on average 1.332155383495467) internal successors, (100651), 76975 states have internal predecessors, (100651), 19990 states have call successors, (19990), 8263 states have call predecessors, (19990), 8334 states have return successors, (20615), 19322 states have call predecessors, (20615), 19881 states have call successors, (20615) [2025-01-09 18:55:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103880 states to 103880 states and 141256 transitions. [2025-01-09 18:55:53,640 INFO L78 Accepts]: Start accepts. Automaton has 103880 states and 141256 transitions. Word has length 482 [2025-01-09 18:55:53,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:55:53,641 INFO L471 AbstractCegarLoop]: Abstraction has 103880 states and 141256 transitions. [2025-01-09 18:55:53,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (55), 2 states have call predecessors, (55), 1 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-01-09 18:55:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 103880 states and 141256 transitions. [2025-01-09 18:55:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 18:55:53,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:55:53,745 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:55:53,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 18:55:53,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:55:53,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:55:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1684344676, now seen corresponding path program 1 times [2025-01-09 18:55:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:55:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627355357] [2025-01-09 18:55:53,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:55:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms