./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:15:36,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:15:36,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:15:36,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:15:36,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:15:36,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:15:36,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:15:36,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:15:36,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:15:36,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:15:36,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:15:36,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:15:36,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:15:36,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:15:36,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:15:36,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:15:36,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:15:36,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:15:36,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:15:36,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:15:36,905 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:15:36,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:15:36,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:15:36,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:15:36,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:15:36,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:15:36,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:15:36,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:15:36,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:15:36,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:15:36,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:15:36,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:15:36,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:15:36,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:15:36,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:15:36,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:15:36,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:15:36,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:15:36,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:15:36,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:15:36,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:15:36,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:15:36,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:15:36,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:15:36,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:15:36,972 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:15:36,972 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:15:36,973 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:15:36,973 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:15:36,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:15:36,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:15:36,974 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:15:36,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:15:36,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:15:36,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:15:36,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:15:36,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:15:36,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:15:36,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:15:36,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:15:36,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:15:36,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:15:36,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:15:36,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:15:36,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:15:36,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:15:36,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:15:36,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:15:36,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:15:36,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:15:36,979 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:15:36,979 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:15:36,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:15:36,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a [2022-07-21 15:15:37,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:15:37,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:15:37,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:15:37,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:15:37,292 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:15:37,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-21 15:15:37,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f27b4d63/88555e38b5fa4f72b10fc72eeb280d71/FLAGfe8b2d4c1 [2022-07-21 15:15:38,089 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:15:38,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-21 15:15:38,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f27b4d63/88555e38b5fa4f72b10fc72eeb280d71/FLAGfe8b2d4c1 [2022-07-21 15:15:38,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f27b4d63/88555e38b5fa4f72b10fc72eeb280d71 [2022-07-21 15:15:38,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:15:38,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:15:38,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:15:38,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:15:38,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:15:38,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:15:38" (1/1) ... [2022-07-21 15:15:38,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555d829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:38, skipping insertion in model container [2022-07-21 15:15:38,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:15:38" (1/1) ... [2022-07-21 15:15:38,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:15:38,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:15:40,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i[338465,338478] [2022-07-21 15:15:40,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:15:40,552 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:15:40,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i[338465,338478] [2022-07-21 15:15:40,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:15:41,194 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:15:41,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41 WrapperNode [2022-07-21 15:15:41,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:15:41,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:15:41,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:15:41,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:15:41,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,468 INFO L137 Inliner]: procedures = 396, calls = 1846, calls flagged for inlining = 235, calls inlined = 222, statements flattened = 5742 [2022-07-21 15:15:41,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:15:41,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:15:41,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:15:41,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:15:41,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:15:41,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:15:41,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:15:41,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:15:41,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (1/1) ... [2022-07-21 15:15:41,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:15:41,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:15:41,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:15:41,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:15:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:15:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:15:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:15:41,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:15:41,865 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-21 15:15:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-21 15:15:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 15:15:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 15:15:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_read [2022-07-21 15:15:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_read [2022-07-21 15:15:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_resume [2022-07-21 15:15:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_resume [2022-07-21 15:15:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 15:15:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 15:15:41,866 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_probe [2022-07-21 15:15:41,866 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_probe [2022-07-21 15:15:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure no_printk [2022-07-21 15:15:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure no_printk [2022-07-21 15:15:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:15:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:15:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-21 15:15:41,867 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-21 15:15:41,867 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_multicast_list [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_multicast_list [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_hw_mac_address [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_hw_mac_address [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure phy_write [2022-07-21 15:15:41,868 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_write [2022-07-21 15:15:41,868 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_remove [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_remove [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_multicast_update [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_multicast_update [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-07-21 15:15:41,869 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-21 15:15:41,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo [2022-07-21 15:15:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:15:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_irqhandler [2022-07-21 15:15:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_irqhandler [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 15:15:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-21 15:15:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-21 15:15:41,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-21 15:15:41,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-21 15:15:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_resources [2022-07-21 15:15:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_resources [2022-07-21 15:15:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_get_rxstatus [2022-07-21 15:15:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_get_rxstatus [2022-07-21 15:15:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read [2022-07-21 15:15:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read [2022-07-21 15:15:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_getregslen [2022-07-21 15:15:41,871 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_getregslen [2022-07-21 15:15:41,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:15:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:15:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-21 15:15:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-21 15:15:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:15:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:15:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 15:15:41,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 15:15:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:15:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:15:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:15:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-21 15:15:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-21 15:15:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:15:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:15:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_write [2022-07-21 15:15:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_write [2022-07-21 15:15:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_complete [2022-07-21 15:15:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_complete [2022-07-21 15:15:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-21 15:15:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-21 15:15:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 15:15:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 15:15:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-21 15:15:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-21 15:15:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32_rep [2022-07-21 15:15:41,875 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32_rep [2022-07-21 15:15:41,875 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-21 15:15:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-21 15:15:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource_byname [2022-07-21 15:15:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource_byname [2022-07-21 15:15:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-21 15:15:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-21 15:15:41,876 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 15:15:41,876 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 15:15:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-21 15:15:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-21 15:15:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:15:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:15:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 15:15:41,877 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 15:15:41,877 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-21 15:15:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-21 15:15:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_get_txstatus [2022-07-21 15:15:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_get_txstatus [2022-07-21 15:15:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-21 15:15:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-21 15:15:41,878 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_free [2022-07-21 15:15:41,878 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_free [2022-07-21 15:15:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:15:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:15:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:15:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:15:41,879 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo [2022-07-21 15:15:41,879 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo [2022-07-21 15:15:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_open [2022-07-21 15:15:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_open [2022-07-21 15:15:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_unregister [2022-07-21 15:15:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_unregister [2022-07-21 15:15:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_get_eeprom_len [2022-07-21 15:15:41,880 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_get_eeprom_len [2022-07-21 15:15:41,880 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo_shift [2022-07-21 15:15:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo_shift [2022-07-21 15:15:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_suspend [2022-07-21 15:15:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_suspend [2022-07-21 15:15:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_read_mac_address [2022-07-21 15:15:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_read_mac_address [2022-07-21 15:15:41,881 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_write [2022-07-21 15:15:41,881 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_write [2022-07-21 15:15:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure phy_read [2022-07-21 15:15:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_read [2022-07-21 15:15:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 15:15:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 15:15:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 15:15:41,882 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 15:15:41,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2022-07-21 15:15:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2022-07-21 15:15:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write [2022-07-21 15:15:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write [2022-07-21 15:15:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:15:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-21 15:15:41,883 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-21 15:15:41,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:15:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_write [2022-07-21 15:15:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_write [2022-07-21 15:15:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_nwayreset [2022-07-21 15:15:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_nwayreset [2022-07-21 15:15:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_free_resources [2022-07-21 15:15:41,884 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_free_resources [2022-07-21 15:15:41,884 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_irq_chip [2022-07-21 15:15:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_irq_chip [2022-07-21 15:15:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:15:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-21 15:15:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-21 15:15:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_send_cmd [2022-07-21 15:15:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_send_cmd [2022-07-21 15:15:41,885 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 15:15:41,885 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 15:15:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_adjust_link [2022-07-21 15:15:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_adjust_link [2022-07-21 15:15:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_read [2022-07-21 15:15:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_read [2022-07-21 15:15:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:15:41,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:15:41,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-21 15:15:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-21 15:15:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_update_txcounters [2022-07-21 15:15:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_update_txcounters [2022-07-21 15:15:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read_shift [2022-07-21 15:15:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read_shift [2022-07-21 15:15:41,887 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 15:15:41,887 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 15:15:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write_shift [2022-07-21 15:15:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write_shift [2022-07-21 15:15:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-21 15:15:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-21 15:15:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 15:15:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 15:15:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 15:15:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 15:15:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-21 15:15:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-21 15:15:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_enable_external [2022-07-21 15:15:41,889 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_enable_external [2022-07-21 15:15:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:15:41,889 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_read [2022-07-21 15:15:41,890 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_read [2022-07-21 15:15:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:15:41,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:15:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-21 15:15:41,890 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-21 15:15:41,890 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-21 15:15:41,890 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-21 15:15:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_soft_reset [2022-07-21 15:15:41,891 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_soft_reset [2022-07-21 15:15:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_enable_access [2022-07-21 15:15:41,891 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_enable_access [2022-07-21 15:15:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32_rep [2022-07-21 15:15:41,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32_rep [2022-07-21 15:15:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure spin_is_locked [2022-07-21 15:15:41,892 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_is_locked [2022-07-21 15:15:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_stop [2022-07-21 15:15:41,892 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_stop [2022-07-21 15:15:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:15:41,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:15:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo_shift [2022-07-21 15:15:41,892 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo_shift [2022-07-21 15:15:41,892 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-21 15:15:41,893 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-21 15:15:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-21 15:15:41,893 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-21 15:15:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:15:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-21 15:15:41,893 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-21 15:15:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-21 15:15:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-21 15:15:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-21 15:15:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-21 15:15:42,714 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:15:42,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:15:42,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:15:45,585 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:15:45,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:15:45,606 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 15:15:45,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:15:45 BoogieIcfgContainer [2022-07-21 15:15:45,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:15:45,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:15:45,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:15:45,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:15:45,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:15:38" (1/3) ... [2022-07-21 15:15:45,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44299b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:15:45, skipping insertion in model container [2022-07-21 15:15:45,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:15:41" (2/3) ... [2022-07-21 15:15:45,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44299b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:15:45, skipping insertion in model container [2022-07-21 15:15:45,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:15:45" (3/3) ... [2022-07-21 15:15:45,620 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-21 15:15:45,633 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:15:45,634 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 15:15:45,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:15:45,763 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1de4074, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b046241 [2022-07-21 15:15:45,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 15:15:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 1658 states have (on average 1.3299155609167672) internal successors, (2205), 1711 states have internal predecessors, (2205), 691 states have call successors, (691), 108 states have call predecessors, (691), 107 states have return successors, (683), 670 states have call predecessors, (683), 683 states have call successors, (683) [2022-07-21 15:15:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-21 15:15:45,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:15:45,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:15:45,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:15:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:15:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1843472669, now seen corresponding path program 1 times [2022-07-21 15:15:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:15:45,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969160882] [2022-07-21 15:15:45,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:15:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:15:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:15:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:15:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:15:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:15:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:15:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 15:15:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:15:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969160882] [2022-07-21 15:15:46,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969160882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:15:46,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:15:46,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 15:15:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544503574] [2022-07-21 15:15:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:15:46,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 15:15:46,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:15:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 15:15:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 15:15:46,537 INFO L87 Difference]: Start difference. First operand has 2456 states, 1658 states have (on average 1.3299155609167672) internal successors, (2205), 1711 states have internal predecessors, (2205), 691 states have call successors, (691), 108 states have call predecessors, (691), 107 states have return successors, (683), 670 states have call predecessors, (683), 683 states have call successors, (683) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 15:15:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:15:46,893 INFO L93 Difference]: Finished difference Result 4885 states and 7351 transitions. [2022-07-21 15:15:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:15:46,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-21 15:15:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:15:46,942 INFO L225 Difference]: With dead ends: 4885 [2022-07-21 15:15:46,942 INFO L226 Difference]: Without dead ends: 2436 [2022-07-21 15:15:46,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:15:46,978 INFO L413 NwaCegarLoop]: 3426 mSDtfsCounter, 3415 mSDsluCounter, 6849 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3417 SdHoareTripleChecker+Valid, 10275 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:15:46,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3417 Valid, 10275 Invalid, 10 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:15:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-07-21 15:15:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-07-21 15:15:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1648 states have (on average 1.2439320388349515) internal successors, (2050), 1694 states have internal predecessors, (2050), 681 states have call successors, (681), 108 states have call predecessors, (681), 106 states have return successors, (678), 665 states have call predecessors, (678), 678 states have call successors, (678) [2022-07-21 15:15:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3409 transitions. [2022-07-21 15:15:47,189 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3409 transitions. Word has length 48 [2022-07-21 15:15:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:15:47,191 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 3409 transitions. [2022-07-21 15:15:47,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 15:15:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3409 transitions. [2022-07-21 15:15:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 15:15:47,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:15:47,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:15:47,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:15:47,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:15:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:15:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2135049724, now seen corresponding path program 1 times [2022-07-21 15:15:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:15:47,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282224926] [2022-07-21 15:15:47,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:15:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:15:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:15:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:15:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:15:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 15:15:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:15:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:15:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 15:15:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:15:47,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282224926] [2022-07-21 15:15:47,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282224926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:15:47,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:15:47,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 15:15:47,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494809617] [2022-07-21 15:15:47,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:15:47,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 15:15:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:15:47,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 15:15:47,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 15:15:47,472 INFO L87 Difference]: Start difference. First operand 2436 states and 3409 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 15:15:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:15:47,731 INFO L93 Difference]: Finished difference Result 4853 states and 6839 transitions. [2022-07-21 15:15:47,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:15:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-07-21 15:15:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:15:47,785 INFO L225 Difference]: With dead ends: 4853 [2022-07-21 15:15:47,785 INFO L226 Difference]: Without dead ends: 4754 [2022-07-21 15:15:47,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:15:47,796 INFO L413 NwaCegarLoop]: 5147 mSDtfsCounter, 3411 mSDsluCounter, 13688 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 18835 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:15:47,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 18835 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:15:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-07-21 15:15:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2022-07-21 15:15:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 3219 states have (on average 1.2454178316247282) internal successors, (4009), 3305 states have internal predecessors, (4009), 1323 states have call successors, (1323), 213 states have call predecessors, (1323), 211 states have return successors, (1368), 1296 states have call predecessors, (1368), 1320 states have call successors, (1368) [2022-07-21 15:15:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6700 transitions. [2022-07-21 15:15:48,052 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6700 transitions. Word has length 53 [2022-07-21 15:15:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:15:48,052 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6700 transitions. [2022-07-21 15:15:48,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-21 15:15:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6700 transitions. [2022-07-21 15:15:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-21 15:15:48,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:15:48,088 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:15:48,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:15:48,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:15:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:15:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash 970042127, now seen corresponding path program 1 times [2022-07-21 15:15:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:15:48,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349249300] [2022-07-21 15:15:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:15:48,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:15:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:15:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:15:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:15:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:15:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:15:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:15:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:15:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:15:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:15:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:15:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:15:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:15:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 15:15:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:15:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:15:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:15:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:15:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:15:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:15:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:15:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:15:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:15:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:15:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:15:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:15:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:15:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:15:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 15:15:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:15:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:15:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:15:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:15:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:15:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-21 15:15:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 15:15:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:15:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:15:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 15:15:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-21 15:15:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-21 15:15:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-21 15:15:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-21 15:15:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-21 15:15:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-21 15:15:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:15:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-21 15:15:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-21 15:15:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-21 15:15:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:15:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2022-07-21 15:15:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:15:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349249300] [2022-07-21 15:15:49,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349249300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:15:49,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:15:49,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 15:15:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174910406] [2022-07-21 15:15:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:15:49,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 15:15:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:15:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 15:15:49,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:15:49,560 INFO L87 Difference]: Start difference. First operand 4754 states and 6700 transitions. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (57), 8 states have call predecessors, (57), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-21 15:16:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:16:05,034 INFO L93 Difference]: Finished difference Result 12573 states and 18366 transitions. [2022-07-21 15:16:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:16:05,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (57), 8 states have call predecessors, (57), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 423 [2022-07-21 15:16:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:16:05,104 INFO L225 Difference]: With dead ends: 12573 [2022-07-21 15:16:05,104 INFO L226 Difference]: Without dead ends: 7834 [2022-07-21 15:16:05,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:16:05,140 INFO L413 NwaCegarLoop]: 3493 mSDtfsCounter, 5390 mSDsluCounter, 13296 mSDsCounter, 0 mSdLazyCounter, 12689 mSolverCounterSat, 3511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6062 SdHoareTripleChecker+Valid, 16789 SdHoareTripleChecker+Invalid, 16200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3511 IncrementalHoareTripleChecker+Valid, 12689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:16:05,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6062 Valid, 16789 Invalid, 16200 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3511 Valid, 12689 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-07-21 15:16:05,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2022-07-21 15:16:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 5504. [2022-07-21 15:16:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5504 states, 3743 states have (on average 1.2492652952177399) internal successors, (4676), 3844 states have internal predecessors, (4676), 1543 states have call successors, (1543), 213 states have call predecessors, (1543), 217 states have return successors, (1637), 1515 states have call predecessors, (1637), 1540 states have call successors, (1637) [2022-07-21 15:16:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5504 states to 5504 states and 7856 transitions. [2022-07-21 15:16:05,780 INFO L78 Accepts]: Start accepts. Automaton has 5504 states and 7856 transitions. Word has length 423 [2022-07-21 15:16:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:16:05,784 INFO L495 AbstractCegarLoop]: Abstraction has 5504 states and 7856 transitions. [2022-07-21 15:16:05,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (57), 8 states have call predecessors, (57), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-21 15:16:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5504 states and 7856 transitions. [2022-07-21 15:16:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-21 15:16:05,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:16:05,804 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:16:05,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:16:05,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:16:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:16:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1308329677, now seen corresponding path program 1 times [2022-07-21 15:16:05,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:16:05,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109818623] [2022-07-21 15:16:05,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:05,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:16:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:16:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:16:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:16:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:16:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:16:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:16:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 15:16:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:16:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:16:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:16:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:16:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:16:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:16:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:16:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:16:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:16:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:16:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:16:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 15:16:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:16:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:16:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:16:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:16:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-21 15:16:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 15:16:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:16:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:16:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 15:16:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-21 15:16:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-21 15:16:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-21 15:16:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-21 15:16:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-21 15:16:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-21 15:16:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-21 15:16:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-21 15:16:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-21 15:16:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2022-07-21 15:16:07,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:16:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109818623] [2022-07-21 15:16:07,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109818623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:16:07,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238424219] [2022-07-21 15:16:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:16:07,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:16:07,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:16:07,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 15:16:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:08,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 3586 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 15:16:08,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:16:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2022-07-21 15:16:08,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:16:08,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238424219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:16:08,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:16:08,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-21 15:16:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871328987] [2022-07-21 15:16:08,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:16:08,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 15:16:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:16:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 15:16:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-21 15:16:08,292 INFO L87 Difference]: Start difference. First operand 5504 states and 7856 transitions. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 3 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2022-07-21 15:16:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:16:08,822 INFO L93 Difference]: Finished difference Result 11049 states and 15862 transitions. [2022-07-21 15:16:08,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:16:08,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 3 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 423 [2022-07-21 15:16:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:16:08,873 INFO L225 Difference]: With dead ends: 11049 [2022-07-21 15:16:08,873 INFO L226 Difference]: Without dead ends: 5560 [2022-07-21 15:16:08,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:16:08,918 INFO L413 NwaCegarLoop]: 3426 mSDtfsCounter, 39 mSDsluCounter, 10172 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 13598 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:16:08,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 13598 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:16:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2022-07-21 15:16:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5541. [2022-07-21 15:16:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 3770 states have (on average 1.2480106100795756) internal successors, (4705), 3872 states have internal predecessors, (4705), 1552 states have call successors, (1552), 213 states have call predecessors, (1552), 218 states have return successors, (1648), 1524 states have call predecessors, (1648), 1549 states have call successors, (1648) [2022-07-21 15:16:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7905 transitions. [2022-07-21 15:16:09,501 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7905 transitions. Word has length 423 [2022-07-21 15:16:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:16:09,502 INFO L495 AbstractCegarLoop]: Abstraction has 5541 states and 7905 transitions. [2022-07-21 15:16:09,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 3 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2022-07-21 15:16:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7905 transitions. [2022-07-21 15:16:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-21 15:16:09,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:16:09,523 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:16:09,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 15:16:09,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:16:09,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:16:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:16:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1554137551, now seen corresponding path program 1 times [2022-07-21 15:16:09,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:16:09,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328625911] [2022-07-21 15:16:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:16:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:16:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:16:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:16:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:16:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:16:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:16:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 15:16:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:16:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:16:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:16:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:16:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:16:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:16:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:16:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:16:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:16:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:16:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:16:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 15:16:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:16:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:16:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:16:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:16:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-21 15:16:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 15:16:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:16:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-21 15:16:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 15:16:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-21 15:16:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-21 15:16:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-21 15:16:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-21 15:16:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-21 15:16:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-21 15:16:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-21 15:16:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-21 15:16:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-21 15:16:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2022-07-21 15:16:10,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:16:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328625911] [2022-07-21 15:16:10,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328625911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:16:10,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874194227] [2022-07-21 15:16:10,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:10,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:16:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:16:10,756 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:16:10,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 15:16:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:11,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-21 15:16:11,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:16:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-21 15:16:11,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:16:11,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874194227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:16:11,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:16:11,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-21 15:16:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040040265] [2022-07-21 15:16:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:16:11,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:16:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:16:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:16:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:16:11,982 INFO L87 Difference]: Start difference. First operand 5541 states and 7905 transitions. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2022-07-21 15:16:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:16:14,444 INFO L93 Difference]: Finished difference Result 14010 states and 20303 transitions. [2022-07-21 15:16:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 15:16:14,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 423 [2022-07-21 15:16:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:16:14,519 INFO L225 Difference]: With dead ends: 14010 [2022-07-21 15:16:14,520 INFO L226 Difference]: Without dead ends: 8484 [2022-07-21 15:16:14,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-07-21 15:16:14,549 INFO L413 NwaCegarLoop]: 4110 mSDtfsCounter, 7697 mSDsluCounter, 23946 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7917 SdHoareTripleChecker+Valid, 28056 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2731 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:16:14,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7917 Valid, 28056 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2731 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:16:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2022-07-21 15:16:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 5558. [2022-07-21 15:16:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 3785 states have (on average 1.2472919418758257) internal successors, (4721), 3887 states have internal predecessors, (4721), 1554 states have call successors, (1554), 213 states have call predecessors, (1554), 218 states have return successors, (1650), 1526 states have call predecessors, (1650), 1551 states have call successors, (1650) [2022-07-21 15:16:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7925 transitions. [2022-07-21 15:16:15,197 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7925 transitions. Word has length 423 [2022-07-21 15:16:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:16:15,198 INFO L495 AbstractCegarLoop]: Abstraction has 5558 states and 7925 transitions. [2022-07-21 15:16:15,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2022-07-21 15:16:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7925 transitions. [2022-07-21 15:16:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2022-07-21 15:16:15,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:16:15,219 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:16:15,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 15:16:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:16:15,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:16:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:16:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2022471282, now seen corresponding path program 1 times [2022-07-21 15:16:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:16:15,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763974440] [2022-07-21 15:16:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:16:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:16:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:16:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:16:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:16:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:16:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:16:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 15:16:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:16:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:16:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:16:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:16:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:16:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:16:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:16:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:16:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:16:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:16:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:16:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 15:16:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 15:16:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:16:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 15:16:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-21 15:16:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:16:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-21 15:16:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:16:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-21 15:16:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-21 15:16:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:16:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-21 15:16:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-21 15:16:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-07-21 15:16:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-07-21 15:16:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-21 15:16:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-21 15:16:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-21 15:16:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-21 15:16:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-07-21 15:16:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-07-21 15:16:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2022-07-21 15:16:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2022-07-21 15:16:16,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:16:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763974440] [2022-07-21 15:16:16,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763974440] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:16:16,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452665179] [2022-07-21 15:16:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:16,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:16:16,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:16:16,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:16:16,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 15:16:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:17,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 3796 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 15:16:17,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:16:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2022-07-21 15:16:17,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:16:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 33 proven. 27 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2022-07-21 15:16:18,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452665179] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:16:18,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:16:18,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 29 [2022-07-21 15:16:18,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500482789] [2022-07-21 15:16:18,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:16:18,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 15:16:18,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:16:18,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 15:16:18,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-07-21 15:16:18,273 INFO L87 Difference]: Start difference. First operand 5558 states and 7925 transitions. Second operand has 29 states, 28 states have (on average 10.035714285714286) internal successors, (281), 20 states have internal predecessors, (281), 7 states have call successors, (104), 9 states have call predecessors, (104), 6 states have return successors, (98), 8 states have call predecessors, (98), 7 states have call successors, (98) [2022-07-21 15:16:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:16:45,410 INFO L93 Difference]: Finished difference Result 11957 states and 17458 transitions. [2022-07-21 15:16:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 15:16:45,410 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 10.035714285714286) internal successors, (281), 20 states have internal predecessors, (281), 7 states have call successors, (104), 9 states have call predecessors, (104), 6 states have return successors, (98), 8 states have call predecessors, (98), 7 states have call successors, (98) Word has length 465 [2022-07-21 15:16:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:16:45,452 INFO L225 Difference]: With dead ends: 11957 [2022-07-21 15:16:45,452 INFO L226 Difference]: Without dead ends: 6413 [2022-07-21 15:16:45,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2022-07-21 15:16:45,480 INFO L413 NwaCegarLoop]: 3766 mSDtfsCounter, 6377 mSDsluCounter, 44131 mSDsCounter, 0 mSdLazyCounter, 48258 mSolverCounterSat, 5669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6943 SdHoareTripleChecker+Valid, 47897 SdHoareTripleChecker+Invalid, 53927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 5669 IncrementalHoareTripleChecker+Valid, 48258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:16:45,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6943 Valid, 47897 Invalid, 53927 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [5669 Valid, 48258 Invalid, 0 Unknown, 0 Unchecked, 24.6s Time] [2022-07-21 15:16:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2022-07-21 15:16:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 5563. [2022-07-21 15:16:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5563 states, 3791 states have (on average 1.2466367713004485) internal successors, (4726), 3888 states have internal predecessors, (4726), 1552 states have call successors, (1552), 213 states have call predecessors, (1552), 219 states have return successors, (1667), 1530 states have call predecessors, (1667), 1550 states have call successors, (1667) [2022-07-21 15:16:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5563 states to 5563 states and 7945 transitions. [2022-07-21 15:16:46,095 INFO L78 Accepts]: Start accepts. Automaton has 5563 states and 7945 transitions. Word has length 465 [2022-07-21 15:16:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:16:46,096 INFO L495 AbstractCegarLoop]: Abstraction has 5563 states and 7945 transitions. [2022-07-21 15:16:46,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 10.035714285714286) internal successors, (281), 20 states have internal predecessors, (281), 7 states have call successors, (104), 9 states have call predecessors, (104), 6 states have return successors, (98), 8 states have call predecessors, (98), 7 states have call successors, (98) [2022-07-21 15:16:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5563 states and 7945 transitions. [2022-07-21 15:16:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-21 15:16:46,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:16:46,116 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:16:46,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 15:16:46,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:16:46,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:16:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:16:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash -107417767, now seen corresponding path program 1 times [2022-07-21 15:16:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:16:46,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488324867] [2022-07-21 15:16:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:16:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:16:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:16:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:16:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:16:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:16:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:16:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:16:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 15:16:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:16:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:16:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:16:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:16:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:16:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:16:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:16:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:16:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:16:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:16:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:16:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:16:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:16:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:16:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:16:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 15:16:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:16:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 15:16:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 15:16:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 15:16:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-21 15:16:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-21 15:16:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:16:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-21 15:16:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:16:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:16:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-21 15:16:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-21 15:16:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-21 15:16:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-21 15:16:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-21 15:16:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-07-21 15:16:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2022-07-21 15:16:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-07-21 15:16:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-21 15:16:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2022-07-21 15:16:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-21 15:16:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:16:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-21 15:16:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-07-21 15:16:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-07-21 15:16:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-07-21 15:16:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:16:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2022-07-21 15:16:47,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:16:47,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488324867] [2022-07-21 15:16:47,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488324867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:16:47,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:16:47,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 15:16:47,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536023096] [2022-07-21 15:16:47,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:16:47,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 15:16:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:16:47,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 15:16:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:16:47,515 INFO L87 Difference]: Start difference. First operand 5563 states and 7945 transitions. Second operand has 12 states, 12 states have (on average 15.583333333333334) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (66), 9 states have call predecessors, (66), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2022-07-21 15:17:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:17:00,956 INFO L93 Difference]: Finished difference Result 11954 states and 17458 transitions. [2022-07-21 15:17:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:17:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.583333333333334) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (66), 9 states have call predecessors, (66), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 494 [2022-07-21 15:17:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:17:01,002 INFO L225 Difference]: With dead ends: 11954 [2022-07-21 15:17:01,002 INFO L226 Difference]: Without dead ends: 6406 [2022-07-21 15:17:01,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:17:01,034 INFO L413 NwaCegarLoop]: 3770 mSDtfsCounter, 3640 mSDsluCounter, 11987 mSDsCounter, 0 mSdLazyCounter, 12285 mSolverCounterSat, 2474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4110 SdHoareTripleChecker+Valid, 15757 SdHoareTripleChecker+Invalid, 14759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2474 IncrementalHoareTripleChecker+Valid, 12285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:17:01,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4110 Valid, 15757 Invalid, 14759 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2474 Valid, 12285 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-07-21 15:17:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2022-07-21 15:17:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5569. [2022-07-21 15:17:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5569 states, 3797 states have (on average 1.24624703713458) internal successors, (4732), 3894 states have internal predecessors, (4732), 1552 states have call successors, (1552), 213 states have call predecessors, (1552), 219 states have return successors, (1667), 1530 states have call predecessors, (1667), 1550 states have call successors, (1667) [2022-07-21 15:17:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 7951 transitions. [2022-07-21 15:17:01,660 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 7951 transitions. Word has length 494 [2022-07-21 15:17:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:17:01,661 INFO L495 AbstractCegarLoop]: Abstraction has 5569 states and 7951 transitions. [2022-07-21 15:17:01,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.583333333333334) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (66), 9 states have call predecessors, (66), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2022-07-21 15:17:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 7951 transitions. [2022-07-21 15:17:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2022-07-21 15:17:01,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:17:01,679 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 9, 9, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:17:01,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:17:01,680 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 15:17:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:17:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -519392329, now seen corresponding path program 1 times [2022-07-21 15:17:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:17:01,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299478267] [2022-07-21 15:17:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:17:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:17:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 15:17:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:17:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:01,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:17:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:17:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:17:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 15:17:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:17:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:17:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:17:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:17:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:17:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:17:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 15:17:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:17:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:17:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:17:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:17:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:17:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 15:17:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 15:17:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:17:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:17:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:17:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 15:17:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:17:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:17:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:17:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:17:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:17:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 15:17:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:17:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 15:17:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 15:17:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-21 15:17:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 15:17:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 15:17:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-21 15:17:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-21 15:17:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:17:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:17:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-21 15:17:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:17:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:17:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-21 15:17:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-21 15:17:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-21 15:17:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-21 15:17:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-21 15:17:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2022-07-21 15:17:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2022-07-21 15:17:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-21 15:17:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-07-21 15:17:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-21 15:17:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2022-07-21 15:17:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:17:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2022-07-21 15:17:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-21 15:17:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2022-07-21 15:17:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2022-07-21 15:17:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2022-07-21 15:17:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:17:03,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299478267] [2022-07-21 15:17:03,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299478267] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:17:03,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015503759] [2022-07-21 15:17:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:17:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:17:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:17:03,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:17:03,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 15:17:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:17:04,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 4001 conjuncts, 514 conjunts are in the unsatisfiable core [2022-07-21 15:17:04,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:17:04,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 15:17:04,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:04,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:04,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:04,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:04,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:04,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:04,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-21 15:17:05,103 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 15:17:05,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-21 15:17:05,565 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-21 15:17:05,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2022-07-21 15:17:05,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-21 15:17:05,608 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-07-21 15:17:05,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 70 [2022-07-21 15:17:05,706 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-21 15:17:05,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2022-07-21 15:17:05,741 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-07-21 15:17:05,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 73 [2022-07-21 15:17:05,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 15:17:05,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 15:17:05,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-21 15:17:05,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 15:17:05,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 15:17:05,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2022-07-21 15:17:05,927 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-21 15:17:05,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 3 [2022-07-21 15:17:06,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 15:17:06,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-21 15:17:06,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 15:17:06,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-21 15:17:07,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:17:07,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 278 treesize of output 398 [2022-07-21 15:17:23,333 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (.cse1 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (and (or (= v_arrayElimCell_26 v_arrayElimCell_23) (not (= .cse0 .cse1))) (let ((.cse7 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse29 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29))) (let ((.cse28 (= v_arrayElimCell_26 0)) (.cse27 (select (select |c_#memory_$Pointer$.base| .cse30) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse27 v_prenex_1)) .cse28) (or (not (= .cse27 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse28) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29)) (= .cse30 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse30 .cse27)))))))) (.cse8 (not (= v_prenex_1 .cse1))) (.cse9 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse25 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| .cse26) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (not (= .cse24 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25)) (= .cse26 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse26 .cse24)))))))) (.cse10 (not (= .cse0 v_prenex_1))) (.cse12 (= v_arrayElimCell_26 0)) (.cse11 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse22 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22))) (let ((.cse21 (select (select |c_#memory_$Pointer$.base| .cse23) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse21 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (= v_arrayElimCell_26 0)) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22)) (= .cse23 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse23 .cse21)))))))) (.cse2 (= v_arrayElimCell_23 0))) (or (and .cse2 (or (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse5 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse4 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5)) (= .cse6 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse3 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse4) (and .cse4 (= v_arrayElimCell_26 0)))) (not (= .cse6 .cse3))))))) (and (or .cse7 (and .cse8 .cse9)) .cse10) .cse11)) (and .cse8 .cse2 .cse12) (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse16 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| .cse17) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse14 (= v_arrayElimCell_23 0)) (.cse15 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16)) (= .cse17 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse13 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse14 .cse15) (and .cse14 .cse15 (= v_arrayElimCell_26 0)))) (not (= .cse17 .cse13))))))) (and (or (and .cse7 .cse2) (and .cse8 (or (and .cse2 .cse9) .cse12))) .cse10) (and (let ((.cse18 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse19 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19))) (and (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19)) (= .cse20 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse20 (select (select |c_#memory_$Pointer$.base| .cse20) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))))))) (or (and .cse18 .cse2 .cse10) (and .cse18 .cse2) (and (or .cse18 (and .cse18 .cse10)) .cse2))) .cse12) (and .cse11 .cse2)))))) is different from true [2022-07-21 15:18:40,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 15:18:40,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 216 treesize of output 346 [2022-07-21 15:18:45,277 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (v_arrayElimCell_26 Int) (v_arrayElimCell_23 Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (.cse1 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (and (or (= v_arrayElimCell_26 v_arrayElimCell_23) (not (= .cse0 .cse1))) (let ((.cse7 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse29 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29))) (let ((.cse28 (= v_arrayElimCell_26 0)) (.cse27 (select (select |c_#memory_$Pointer$.base| .cse30) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse27 v_prenex_1)) .cse28) (or (not (= .cse27 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse28) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse29)) (= .cse30 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse30 .cse27)))))))) (.cse8 (not (= v_prenex_1 .cse1))) (.cse9 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse25 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25))) (let ((.cse24 (select (select |c_#memory_$Pointer$.base| .cse26) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (not (= .cse24 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse25)) (= .cse26 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse26 .cse24)))))))) (.cse10 (not (= .cse0 v_prenex_1))) (.cse12 (= v_arrayElimCell_26 0)) (.cse11 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse22 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22))) (let ((.cse21 (select (select |c_#memory_$Pointer$.base| .cse23) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (or (not (= .cse21 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) (= v_arrayElimCell_26 0)) (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse22)) (= .cse23 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse23 .cse21)))))))) (.cse2 (= v_arrayElimCell_23 0))) (or (and .cse2 (or (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse5 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse4 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse5)) (= .cse6 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse3 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse4) (and .cse4 (= v_arrayElimCell_26 0)))) (not (= .cse6 .cse3))))))) (and (or .cse7 (and .cse8 .cse9)) .cse10) .cse11)) (and .cse8 .cse2 .cse12) (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse16 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| .cse17) |ldv_dev_set_drvdata_~tmp~122#1.offset|))) (and (let ((.cse14 (= v_arrayElimCell_23 0)) (.cse15 (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse16)) (= .cse17 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)))) (or (and (not (= .cse13 (select (select |c_#memory_$Pointer$.base| v_prenex_1) v_prenex_3))) .cse14 .cse15) (and .cse14 .cse15 (= v_arrayElimCell_26 0)))) (not (= .cse17 .cse13))))))) (and (or (and .cse7 .cse2) (and .cse8 (or (and .cse2 .cse9) .cse12))) .cse10) (and (let ((.cse18 (exists ((|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse19 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19))) (and (or (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse19)) (= .cse20 |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|)) (not (= .cse20 (select (select |c_#memory_$Pointer$.base| .cse20) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))))))) (or (and .cse18 .cse2 .cse10) (and .cse18 .cse2) (and (or .cse18 (and .cse18 .cse10)) .cse2))) .cse12) (and .cse11 .cse2)))))) (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_prenex_5) v_prenex_6) v_prenex_5))) (exists ((|v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3| Int) (|v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12| Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int)) (let ((.cse32 (+ 21 |v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3|))) (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) .cse32))) (and (or (= |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12| .cse31) (= |ldv_dev_set_drvdata_~tmp~122#1.offset| (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) .cse32))) (not (= .cse31 (select (select |c_#memory_$Pointer$.base| .cse31) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))))))) is different from true [2022-07-21 15:19:03,144 INFO L356 Elim1Store]: treesize reduction 50, result has 71.6 percent of original size [2022-07-21 15:19:03,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1002 treesize of output 844 [2022-07-21 15:19:03,243 INFO L356 Elim1Store]: treesize reduction 38, result has 64.2 percent of original size [2022-07-21 15:19:03,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 850 treesize of output 876 [2022-07-21 15:19:03,258 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 15:19:03,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 15:19:03,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:19:03,472 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 15:19:03,476 INFO L158 Benchmark]: Toolchain (without parser) took 205286.45ms. Allocated memory was 62.9MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 30.0MB in the beginning and 829.6MB in the end (delta: -799.7MB). Peak memory consumption was 750.5MB. Max. memory is 16.1GB. [2022-07-21 15:19:03,476 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 15:19:03,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3005.39ms. Allocated memory was 62.9MB in the beginning and 169.9MB in the end (delta: 107.0MB). Free memory was 29.8MB in the beginning and 107.5MB in the end (delta: -77.7MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. [2022-07-21 15:19:03,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 272.84ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 73.9MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-21 15:19:03,476 INFO L158 Benchmark]: Boogie Preprocessor took 328.55ms. Allocated memory is still 169.9MB. Free memory was 73.9MB in the beginning and 74.5MB in the end (delta: -568.6kB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-07-21 15:19:03,477 INFO L158 Benchmark]: RCFGBuilder took 3811.75ms. Allocated memory was 169.9MB in the beginning and 507.5MB in the end (delta: 337.6MB). Free memory was 74.5MB in the beginning and 295.9MB in the end (delta: -221.4MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2022-07-21 15:19:03,477 INFO L158 Benchmark]: TraceAbstraction took 197862.53ms. Allocated memory was 507.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 295.9MB in the beginning and 829.6MB in the end (delta: -533.7MB). Peak memory consumption was 573.8MB. Max. memory is 16.1GB. [2022-07-21 15:19:03,478 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3005.39ms. Allocated memory was 62.9MB in the beginning and 169.9MB in the end (delta: 107.0MB). Free memory was 29.8MB in the beginning and 107.5MB in the end (delta: -77.7MB). Peak memory consumption was 71.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 272.84ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 73.9MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 328.55ms. Allocated memory is still 169.9MB. Free memory was 73.9MB in the beginning and 74.5MB in the end (delta: -568.6kB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3811.75ms. Allocated memory was 169.9MB in the beginning and 507.5MB in the end (delta: 337.6MB). Free memory was 74.5MB in the beginning and 295.9MB in the end (delta: -221.4MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. * TraceAbstraction took 197862.53ms. Allocated memory was 507.5MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 295.9MB in the beginning and 829.6MB in the end (delta: -533.7MB). Peak memory consumption was 573.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 15:19:03,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:19:05,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:19:05,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:19:05,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:19:05,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:19:05,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:19:05,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:19:05,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:19:05,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:19:05,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:19:05,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:19:05,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:19:05,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:19:05,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:19:05,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:19:05,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:19:05,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:19:05,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:19:05,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:19:05,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:19:05,507 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:19:05,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:19:05,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:19:05,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:19:05,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:19:05,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:19:05,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:19:05,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:19:05,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:19:05,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:19:05,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:19:05,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:19:05,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:19:05,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:19:05,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:19:05,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:19:05,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:19:05,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:19:05,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:19:05,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:19:05,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:19:05,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:19:05,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-21 15:19:05,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:19:05,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:19:05,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:19:05,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:19:05,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:19:05,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:19:05,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:19:05,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:19:05,568 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:19:05,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:19:05,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:19:05,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:19:05,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:19:05,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:19:05,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 15:19:05,570 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 15:19:05,571 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 15:19:05,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:19:05,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:19:05,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:19:05,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:19:05,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:19:05,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:19:05,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:19:05,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:19:05,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:19:05,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:19:05,573 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 15:19:05,573 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 15:19:05,573 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:19:05,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:19:05,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:19:05,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 15:19:05,574 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a [2022-07-21 15:19:05,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:19:05,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:19:05,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:19:05,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:19:05,899 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:19:05,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-21 15:19:05,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1596665a8/7ddf49fc00534930a6aca9ce4ef4e455/FLAGe38b64535 [2022-07-21 15:19:06,725 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:19:06,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-21 15:19:06,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1596665a8/7ddf49fc00534930a6aca9ce4ef4e455/FLAGe38b64535 [2022-07-21 15:19:06,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1596665a8/7ddf49fc00534930a6aca9ce4ef4e455 [2022-07-21 15:19:06,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:19:06,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:19:06,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:19:06,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:19:06,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:19:06,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:19:06" (1/1) ... [2022-07-21 15:19:06,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60802eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:19:06, skipping insertion in model container [2022-07-21 15:19:06,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:19:06" (1/1) ... [2022-07-21 15:19:06,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:19:07,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:19:08,083 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.IllegalArgumentException: cannot determine size of incomplete type at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:256) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:203) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1000) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:729) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 15:19:08,088 INFO L158 Benchmark]: Toolchain (without parser) took 1141.97ms. Allocated memory was 54.5MB in the beginning and 88.1MB in the end (delta: 33.6MB). Free memory was 28.3MB in the beginning and 40.5MB in the end (delta: -12.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2022-07-21 15:19:08,089 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 15:19:08,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1140.22ms. Allocated memory was 54.5MB in the beginning and 88.1MB in the end (delta: 33.6MB). Free memory was 28.2MB in the beginning and 40.5MB in the end (delta: -12.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2022-07-21 15:19:08,091 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 54.5MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1140.22ms. Allocated memory was 54.5MB in the beginning and 88.1MB in the end (delta: 33.6MB). Free memory was 28.2MB in the beginning and 40.5MB in the end (delta: -12.3MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: IllegalArgumentException: cannot determine size of incomplete type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: IllegalArgumentException: cannot determine size of incomplete type: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:256) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: cannot determine size of incomplete type