./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.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-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.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 c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:31:16,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:31:16,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:31:16,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:31:16,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:31:16,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:31:16,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:31:16,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:31:16,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:31:16,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:31:16,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:31:16,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:31:16,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:31:16,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:31:16,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:31:16,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:31:16,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:31:16,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:31:16,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:31:16,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:31:16,716 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:31:16,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:31:16,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:31:16,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:31:16,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:31:16,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:31:16,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:31:16,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:31:16,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:31:16,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:31:16,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:31:16,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:31:16,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:31:16,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:31:16,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:31:16,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:31:16,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:31:16,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:31:16,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:31:16,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:31:16,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:31:16,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:31:16,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:31:16,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:31:16,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:31:16,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:31:16,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:31:16,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:31:16,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:31:16,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:31:16,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:31:16,787 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:31:16,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:31:16,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:31:16,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:31:16,788 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:31:16,788 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:31:16,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:31:16,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:31:16,789 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:31:16,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:31:16,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:31:16,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:31:16,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:31:16,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:31:16,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:31:16,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:31:16,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:31:16,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:31:16,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:31:16,791 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:31:16,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:31:16,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:31:16,792 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 -> c0e62a2f55ddaeb08563a2d9bb0bfed8d8d740037b0faa92e9ebf8fe89adc120 [2022-07-21 11:31:17,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:31:17,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:31:17,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:31:17,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:31:17,152 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:31:17,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-07-21 11:31:17,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5718d6bcc/18f97471ad154090a2a15d0142e5bd68/FLAG93d6cd679 [2022-07-21 11:31:17,864 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:31:17,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-07-21 11:31:17,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5718d6bcc/18f97471ad154090a2a15d0142e5bd68/FLAG93d6cd679 [2022-07-21 11:31:18,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5718d6bcc/18f97471ad154090a2a15d0142e5bd68 [2022-07-21 11:31:18,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:31:18,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:31:18,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:31:18,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:31:18,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:31:18,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:31:18" (1/1) ... [2022-07-21 11:31:18,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9c23c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:18, skipping insertion in model container [2022-07-21 11:31:18,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:31:18" (1/1) ... [2022-07-21 11:31:18,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:31:18,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:31:18,502 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-07-21 11:31:18,502 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-07-21 11:31:18,607 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-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-07-21 11:31:18,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:31:18,861 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:31:18,926 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2022-07-21 11:31:18,928 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2022-07-21 11:31:18,947 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-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i[52456,52469] [2022-07-21 11:31:19,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:31:19,063 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:31:19,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19 WrapperNode [2022-07-21 11:31:19,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:31:19,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:31:19,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:31:19,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:31:19,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,174 INFO L137 Inliner]: procedures = 114, calls = 288, calls flagged for inlining = 49, calls inlined = 38, statements flattened = 878 [2022-07-21 11:31:19,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:31:19,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:31:19,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:31:19,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:31:19,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:31:19,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:31:19,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:31:19,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:31:19,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (1/1) ... [2022-07-21 11:31:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:31:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:31:19,317 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 11:31:19,360 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 11:31:19,376 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2022-07-21 11:31:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2022-07-21 11:31:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2022-07-21 11:31:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2022-07-21 11:31:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:31:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:31:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:31:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2022-07-21 11:31:19,378 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2022-07-21 11:31:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-21 11:31:19,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-21 11:31:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:31:19,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:31:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2022-07-21 11:31:19,379 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2022-07-21 11:31:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2022-07-21 11:31:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2022-07-21 11:31:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 11:31:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 11:31:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:31:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:31:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2022-07-21 11:31:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2022-07-21 11:31:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:31:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:31:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:31:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2022-07-21 11:31:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2022-07-21 11:31:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2022-07-21 11:31:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2022-07-21 11:31:19,382 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2022-07-21 11:31:19,382 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2022-07-21 11:31:19,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:31:19,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:31:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:31:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2022-07-21 11:31:19,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2022-07-21 11:31:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:31:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-21 11:31:19,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-21 11:31:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:31:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:31:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2022-07-21 11:31:19,384 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2022-07-21 11:31:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:31:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-07-21 11:31:19,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-07-21 11:31:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2022-07-21 11:31:19,385 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2022-07-21 11:31:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:31:19,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:31:19,386 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2022-07-21 11:31:19,386 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2022-07-21 11:31:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 11:31:19,387 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 11:31:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2022-07-21 11:31:19,388 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2022-07-21 11:31:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2022-07-21 11:31:19,388 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2022-07-21 11:31:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:31:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 11:31:19,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 11:31:19,389 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2022-07-21 11:31:19,389 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2022-07-21 11:31:19,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:31:19,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:31:19,649 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:31:19,652 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:31:19,833 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:31:20,463 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:31:20,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:31:20,473 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:31:20,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:31:20 BoogieIcfgContainer [2022-07-21 11:31:20,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:31:20,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:31:20,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:31:20,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:31:20,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:31:18" (1/3) ... [2022-07-21 11:31:20,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d02b879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:31:20, skipping insertion in model container [2022-07-21 11:31:20,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:31:19" (2/3) ... [2022-07-21 11:31:20,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d02b879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:31:20, skipping insertion in model container [2022-07-21 11:31:20,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:31:20" (3/3) ... [2022-07-21 11:31:20,484 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2022-07-21 11:31:20,498 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:31:20,499 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:31:20,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:31:20,558 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@2ec5dbd7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56ed2485 [2022-07-21 11:31:20,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:31:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-07-21 11:31:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 11:31:20,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:20,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:20,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1909877325, now seen corresponding path program 1 times [2022-07-21 11:31:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:20,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733974993] [2022-07-21 11:31:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:31:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:20,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733974993] [2022-07-21 11:31:20,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733974993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:20,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:20,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:31:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311078827] [2022-07-21 11:31:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:21,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:31:21,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:31:21,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:31:21,037 INFO L87 Difference]: Start difference. First operand has 347 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 274 states have internal predecessors, (364), 61 states have call successors, (61), 27 states have call predecessors, (61), 26 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:31:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:21,909 INFO L93 Difference]: Finished difference Result 1016 states and 1435 transitions. [2022-07-21 11:31:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:31:21,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-07-21 11:31:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:21,942 INFO L225 Difference]: With dead ends: 1016 [2022-07-21 11:31:21,942 INFO L226 Difference]: Without dead ends: 571 [2022-07-21 11:31:21,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:31:21,952 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 620 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:21,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 911 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 11:31:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-21 11:31:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 524. [2022-07-21 11:31:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 408 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-07-21 11:31:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2022-07-21 11:31:22,050 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 45 [2022-07-21 11:31:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:22,051 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2022-07-21 11:31:22,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:31:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2022-07-21 11:31:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 11:31:22,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:22,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:22,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:31:22,055 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:22,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1822185999, now seen corresponding path program 1 times [2022-07-21 11:31:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511043946] [2022-07-21 11:31:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:22,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:22,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 11:31:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:22,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511043946] [2022-07-21 11:31:22,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511043946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:22,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:22,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:31:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444342497] [2022-07-21 11:31:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:22,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:31:22,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:31:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:31:22,224 INFO L87 Difference]: Start difference. First operand 524 states and 714 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:31:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:23,147 INFO L93 Difference]: Finished difference Result 1271 states and 1794 transitions. [2022-07-21 11:31:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:31:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-07-21 11:31:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:23,159 INFO L225 Difference]: With dead ends: 1271 [2022-07-21 11:31:23,160 INFO L226 Difference]: Without dead ends: 767 [2022-07-21 11:31:23,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:31:23,170 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 744 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:23,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1636 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 11:31:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-07-21 11:31:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 525. [2022-07-21 11:31:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 409 states have internal predecessors, (548), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-07-21 11:31:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 715 transitions. [2022-07-21 11:31:23,228 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 715 transitions. Word has length 47 [2022-07-21 11:31:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:23,228 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 715 transitions. [2022-07-21 11:31:23,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:31:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 715 transitions. [2022-07-21 11:31:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 11:31:23,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:23,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:31:23,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -478636591, now seen corresponding path program 1 times [2022-07-21 11:31:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223181744] [2022-07-21 11:31:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 11:31:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:23,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223181744] [2022-07-21 11:31:23,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223181744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:23,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:23,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:31:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857593541] [2022-07-21 11:31:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:23,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:31:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:31:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:31:23,333 INFO L87 Difference]: Start difference. First operand 525 states and 715 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:31:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:23,659 INFO L93 Difference]: Finished difference Result 1074 states and 1473 transitions. [2022-07-21 11:31:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:31:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-07-21 11:31:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:23,663 INFO L225 Difference]: With dead ends: 1074 [2022-07-21 11:31:23,664 INFO L226 Difference]: Without dead ends: 569 [2022-07-21 11:31:23,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:31:23,666 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 509 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:23,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 671 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 11:31:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-21 11:31:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 525. [2022-07-21 11:31:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 398 states have (on average 1.3743718592964824) internal successors, (547), 409 states have internal predecessors, (547), 86 states have call successors, (86), 45 states have call predecessors, (86), 40 states have return successors, (81), 76 states have call predecessors, (81), 81 states have call successors, (81) [2022-07-21 11:31:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 714 transitions. [2022-07-21 11:31:23,709 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 714 transitions. Word has length 47 [2022-07-21 11:31:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:23,710 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 714 transitions. [2022-07-21 11:31:23,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 11:31:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 714 transitions. [2022-07-21 11:31:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 11:31:23,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:23,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:23,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:31:23,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:23,719 INFO L85 PathProgramCache]: Analyzing trace with hash -457513191, now seen corresponding path program 1 times [2022-07-21 11:31:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:23,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060801228] [2022-07-21 11:31:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:23,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060801228] [2022-07-21 11:31:23,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060801228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:23,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:23,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:31:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870947785] [2022-07-21 11:31:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:23,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:31:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:31:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:31:23,879 INFO L87 Difference]: Start difference. First operand 525 states and 714 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-21 11:31:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:24,493 INFO L93 Difference]: Finished difference Result 1054 states and 1484 transitions. [2022-07-21 11:31:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:31:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2022-07-21 11:31:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:24,500 INFO L225 Difference]: With dead ends: 1054 [2022-07-21 11:31:24,501 INFO L226 Difference]: Without dead ends: 1025 [2022-07-21 11:31:24,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:31:24,502 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 617 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:24,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 916 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 11:31:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-07-21 11:31:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 932. [2022-07-21 11:31:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 719 states have (on average 1.411682892906815) internal successors, (1015), 743 states have internal predecessors, (1015), 143 states have call successors, (143), 69 states have call predecessors, (143), 69 states have return successors, (147), 131 states have call predecessors, (147), 138 states have call successors, (147) [2022-07-21 11:31:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1305 transitions. [2022-07-21 11:31:24,575 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1305 transitions. Word has length 50 [2022-07-21 11:31:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:24,576 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1305 transitions. [2022-07-21 11:31:24,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-21 11:31:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1305 transitions. [2022-07-21 11:31:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 11:31:24,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:24,579 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:31:24,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:31:24,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash 638272764, now seen corresponding path program 1 times [2022-07-21 11:31:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:24,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420391072] [2022-07-21 11:31:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:31:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 11:31:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:24,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420391072] [2022-07-21 11:31:24,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420391072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:24,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:24,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:31:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334152242] [2022-07-21 11:31:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:24,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:31:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:31:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:31:24,678 INFO L87 Difference]: Start difference. First operand 932 states and 1305 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 11:31:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:25,685 INFO L93 Difference]: Finished difference Result 2764 states and 3873 transitions. [2022-07-21 11:31:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:31:25,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2022-07-21 11:31:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:25,696 INFO L225 Difference]: With dead ends: 2764 [2022-07-21 11:31:25,697 INFO L226 Difference]: Without dead ends: 1852 [2022-07-21 11:31:25,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:31:25,702 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 1112 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:25,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 1098 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 11:31:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-07-21 11:31:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2022-07-21 11:31:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1288 states have (on average 1.4122670807453417) internal successors, (1819), 1328 states have internal predecessors, (1819), 247 states have call successors, (247), 126 states have call predecessors, (247), 123 states have return successors, (246), 228 states have call predecessors, (246), 242 states have call successors, (246) [2022-07-21 11:31:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2312 transitions. [2022-07-21 11:31:25,818 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2312 transitions. Word has length 65 [2022-07-21 11:31:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:25,818 INFO L495 AbstractCegarLoop]: Abstraction has 1659 states and 2312 transitions. [2022-07-21 11:31:25,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 11:31:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2312 transitions. [2022-07-21 11:31:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 11:31:25,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:25,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:31:25,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:31:25,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1750010362, now seen corresponding path program 1 times [2022-07-21 11:31:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:25,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225356702] [2022-07-21 11:31:25,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 11:31:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 11:31:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-21 11:31:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:25,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225356702] [2022-07-21 11:31:25,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225356702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:25,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:25,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:31:25,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3492591] [2022-07-21 11:31:25,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:25,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:31:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:25,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:31:25,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:31:25,924 INFO L87 Difference]: Start difference. First operand 1659 states and 2312 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 11:31:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:26,679 INFO L93 Difference]: Finished difference Result 3474 states and 4860 transitions. [2022-07-21 11:31:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:31:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-07-21 11:31:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:26,689 INFO L225 Difference]: With dead ends: 3474 [2022-07-21 11:31:26,690 INFO L226 Difference]: Without dead ends: 1803 [2022-07-21 11:31:26,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:31:26,696 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 434 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:26,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1302 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:31:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2022-07-21 11:31:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1639. [2022-07-21 11:31:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1272 states have (on average 1.404874213836478) internal successors, (1787), 1312 states have internal predecessors, (1787), 243 states have call successors, (243), 126 states have call predecessors, (243), 123 states have return successors, (242), 224 states have call predecessors, (242), 238 states have call successors, (242) [2022-07-21 11:31:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2272 transitions. [2022-07-21 11:31:26,814 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2272 transitions. Word has length 73 [2022-07-21 11:31:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:26,814 INFO L495 AbstractCegarLoop]: Abstraction has 1639 states and 2272 transitions. [2022-07-21 11:31:26,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 11:31:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2272 transitions. [2022-07-21 11:31:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 11:31:26,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:26,817 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, 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 11:31:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:31:26,820 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:26,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1924223221, now seen corresponding path program 1 times [2022-07-21 11:31:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581316599] [2022-07-21 11:31:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 11:31:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 11:31:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:26,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:26,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581316599] [2022-07-21 11:31:26,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581316599] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:26,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:26,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:31:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329317846] [2022-07-21 11:31:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:31:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:31:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:31:26,933 INFO L87 Difference]: Start difference. First operand 1639 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 11:31:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:27,829 INFO L93 Difference]: Finished difference Result 4908 states and 6816 transitions. [2022-07-21 11:31:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:31:27,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2022-07-21 11:31:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:27,848 INFO L225 Difference]: With dead ends: 4908 [2022-07-21 11:31:27,848 INFO L226 Difference]: Without dead ends: 3289 [2022-07-21 11:31:27,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 11:31:27,856 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 847 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:27,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1186 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 11:31:27,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2022-07-21 11:31:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2936. [2022-07-21 11:31:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2278 states have (on average 1.3999122036874452) internal successors, (3189), 2354 states have internal predecessors, (3189), 428 states have call successors, (428), 230 states have call predecessors, (428), 229 states have return successors, (431), 395 states have call predecessors, (431), 423 states have call successors, (431) [2022-07-21 11:31:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4048 transitions. [2022-07-21 11:31:28,035 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4048 transitions. Word has length 71 [2022-07-21 11:31:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:28,036 INFO L495 AbstractCegarLoop]: Abstraction has 2936 states and 4048 transitions. [2022-07-21 11:31:28,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 11:31:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4048 transitions. [2022-07-21 11:31:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 11:31:28,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:28,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-21 11:31:28,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:31:28,046 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1077933097, now seen corresponding path program 1 times [2022-07-21 11:31:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:28,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603756660] [2022-07-21 11:31:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 11:31:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:31:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-21 11:31:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 11:31:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:28,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603756660] [2022-07-21 11:31:28,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603756660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:28,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:31:28,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9838692] [2022-07-21 11:31:28,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:28,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:31:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:28,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:31:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:31:28,222 INFO L87 Difference]: Start difference. First operand 2936 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:29,511 INFO L93 Difference]: Finished difference Result 7847 states and 10900 transitions. [2022-07-21 11:31:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 11:31:29,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2022-07-21 11:31:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:29,540 INFO L225 Difference]: With dead ends: 7847 [2022-07-21 11:31:29,540 INFO L226 Difference]: Without dead ends: 4931 [2022-07-21 11:31:29,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:31:29,549 INFO L413 NwaCegarLoop]: 733 mSDtfsCounter, 1054 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:29,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1581 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 11:31:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2022-07-21 11:31:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4414. [2022-07-21 11:31:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4414 states, 3444 states have (on average 1.3945993031358885) internal successors, (4803), 3560 states have internal predecessors, (4803), 627 states have call successors, (627), 341 states have call predecessors, (627), 342 states have return successors, (634), 580 states have call predecessors, (634), 622 states have call successors, (634) [2022-07-21 11:31:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 6064 transitions. [2022-07-21 11:31:29,855 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 6064 transitions. Word has length 117 [2022-07-21 11:31:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:29,856 INFO L495 AbstractCegarLoop]: Abstraction has 4414 states and 6064 transitions. [2022-07-21 11:31:29,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6064 transitions. [2022-07-21 11:31:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 11:31:29,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:29,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:29,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:31:29,868 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1717722878, now seen corresponding path program 1 times [2022-07-21 11:31:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735017931] [2022-07-21 11:31:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 11:31:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:31:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 11:31:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 11:31:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 11:31:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:29,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735017931] [2022-07-21 11:31:29,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735017931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:29,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:29,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:31:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138524381] [2022-07-21 11:31:29,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:29,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:31:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:31:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:31:29,997 INFO L87 Difference]: Start difference. First operand 4414 states and 6064 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:31,337 INFO L93 Difference]: Finished difference Result 11777 states and 16307 transitions. [2022-07-21 11:31:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 11:31:31,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2022-07-21 11:31:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:31,377 INFO L225 Difference]: With dead ends: 11777 [2022-07-21 11:31:31,377 INFO L226 Difference]: Without dead ends: 7383 [2022-07-21 11:31:31,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:31:31,390 INFO L413 NwaCegarLoop]: 708 mSDtfsCounter, 788 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:31,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1866 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 11:31:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2022-07-21 11:31:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6624. [2022-07-21 11:31:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 5195 states have (on average 1.3897978825794033) internal successors, (7220), 5371 states have internal predecessors, (7220), 918 states have call successors, (918), 506 states have call predecessors, (918), 510 states have return successors, (931), 850 states have call predecessors, (931), 913 states have call successors, (931) [2022-07-21 11:31:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 9069 transitions. [2022-07-21 11:31:31,753 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 9069 transitions. Word has length 123 [2022-07-21 11:31:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:31,754 INFO L495 AbstractCegarLoop]: Abstraction has 6624 states and 9069 transitions. [2022-07-21 11:31:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 9069 transitions. [2022-07-21 11:31:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 11:31:31,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:31,762 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:31:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:31:31,762 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash 723546157, now seen corresponding path program 1 times [2022-07-21 11:31:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:31,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096855738] [2022-07-21 11:31:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 11:31:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:31:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 11:31:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:31,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 11:31:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 11:31:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:32,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096855738] [2022-07-21 11:31:32,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096855738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:31:32,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579620543] [2022-07-21 11:31:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:32,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:31:32,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:31:32,011 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 11:31:32,044 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 11:31:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:32,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:31:32,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:31:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 11:31:32,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:31:32,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579620543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:32,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:31:32,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-21 11:31:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674754732] [2022-07-21 11:31:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:32,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:31:32,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:32,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:31:32,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:31:32,449 INFO L87 Difference]: Start difference. First operand 6624 states and 9069 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:31:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:32,838 INFO L93 Difference]: Finished difference Result 13336 states and 18277 transitions. [2022-07-21 11:31:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:31:32,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 127 [2022-07-21 11:31:32,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:32,869 INFO L225 Difference]: With dead ends: 13336 [2022-07-21 11:31:32,869 INFO L226 Difference]: Without dead ends: 6606 [2022-07-21 11:31:32,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-21 11:31:32,883 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 6 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:32,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1767 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 11:31:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2022-07-21 11:31:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6606. [2022-07-21 11:31:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 5159 states have (on average 1.3855398333010274) internal successors, (7148), 5344 states have internal predecessors, (7148), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2022-07-21 11:31:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 9024 transitions. [2022-07-21 11:31:33,234 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 9024 transitions. Word has length 127 [2022-07-21 11:31:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:33,234 INFO L495 AbstractCegarLoop]: Abstraction has 6606 states and 9024 transitions. [2022-07-21 11:31:33,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:31:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 9024 transitions. [2022-07-21 11:31:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-21 11:31:33,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:33,241 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:31:33,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 11:31:33,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 11:31:33,468 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1165331384, now seen corresponding path program 1 times [2022-07-21 11:31:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:33,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210869529] [2022-07-21 11:31:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 11:31:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 11:31:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 11:31:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 11:31:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 11:31:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:33,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210869529] [2022-07-21 11:31:33,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210869529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:33,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:33,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:31:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867647943] [2022-07-21 11:31:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:33,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:31:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:31:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:31:33,603 INFO L87 Difference]: Start difference. First operand 6606 states and 9024 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:31:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:34,540 INFO L93 Difference]: Finished difference Result 13880 states and 19040 transitions. [2022-07-21 11:31:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:31:34,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2022-07-21 11:31:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:34,571 INFO L225 Difference]: With dead ends: 13880 [2022-07-21 11:31:34,571 INFO L226 Difference]: Without dead ends: 7294 [2022-07-21 11:31:34,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:31:34,586 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 721 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:34,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1209 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:31:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-07-21 11:31:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6570. [2022-07-21 11:31:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 5123 states have (on average 1.3812219402693735) internal successors, (7076), 5308 states have internal predecessors, (7076), 936 states have call successors, (936), 506 states have call predecessors, (936), 510 states have return successors, (940), 859 states have call predecessors, (940), 922 states have call successors, (940) [2022-07-21 11:31:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8952 transitions. [2022-07-21 11:31:34,950 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8952 transitions. Word has length 129 [2022-07-21 11:31:34,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:34,951 INFO L495 AbstractCegarLoop]: Abstraction has 6570 states and 8952 transitions. [2022-07-21 11:31:34,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:31:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8952 transitions. [2022-07-21 11:31:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 11:31:34,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:34,959 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:31:34,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 11:31:34,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash -985966780, now seen corresponding path program 1 times [2022-07-21 11:31:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647609994] [2022-07-21 11:31:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:34,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:31:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 11:31:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:31:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:31:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 11:31:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647609994] [2022-07-21 11:31:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647609994] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:31:35,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979303493] [2022-07-21 11:31:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:31:35,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:31:35,149 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 11:31:35,181 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 11:31:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:35,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 11:31:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:31:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 11:31:35,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:31:35,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979303493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:35,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:31:35,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2022-07-21 11:31:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174434762] [2022-07-21 11:31:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:35,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:31:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:35,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:31:35,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:31:35,565 INFO L87 Difference]: Start difference. First operand 6570 states and 8952 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-21 11:31:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:36,358 INFO L93 Difference]: Finished difference Result 19649 states and 26785 transitions. [2022-07-21 11:31:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:31:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 130 [2022-07-21 11:31:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:36,434 INFO L225 Difference]: With dead ends: 19649 [2022-07-21 11:31:36,434 INFO L226 Difference]: Without dead ends: 19622 [2022-07-21 11:31:36,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:31:36,450 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 774 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:36,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1682 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:31:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2022-07-21 11:31:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 19472. [2022-07-21 11:31:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19472 states, 15165 states have (on average 1.3853610286844709) internal successors, (21009), 15720 states have internal predecessors, (21009), 2784 states have call successors, (2784), 1500 states have call predecessors, (2784), 1522 states have return successors, (2806), 2563 states have call predecessors, (2806), 2752 states have call successors, (2806) [2022-07-21 11:31:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19472 states to 19472 states and 26599 transitions. [2022-07-21 11:31:37,506 INFO L78 Accepts]: Start accepts. Automaton has 19472 states and 26599 transitions. Word has length 130 [2022-07-21 11:31:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:37,507 INFO L495 AbstractCegarLoop]: Abstraction has 19472 states and 26599 transitions. [2022-07-21 11:31:37,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-21 11:31:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19472 states and 26599 transitions. [2022-07-21 11:31:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 11:31:37,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:37,526 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:37,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-21 11:31:37,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 11:31:37,742 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1089963992, now seen corresponding path program 1 times [2022-07-21 11:31:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:37,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860659826] [2022-07-21 11:31:37,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:37,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:31:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 11:31:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:31:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:31:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 11:31:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860659826] [2022-07-21 11:31:37,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860659826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:37,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:37,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:31:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653219349] [2022-07-21 11:31:37,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:37,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:31:37,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:37,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:31:37,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:31:37,923 INFO L87 Difference]: Start difference. First operand 19472 states and 26599 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:31:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:38,969 INFO L93 Difference]: Finished difference Result 26068 states and 35801 transitions. [2022-07-21 11:31:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 11:31:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 135 [2022-07-21 11:31:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:38,991 INFO L225 Difference]: With dead ends: 26068 [2022-07-21 11:31:38,992 INFO L226 Difference]: Without dead ends: 6429 [2022-07-21 11:31:39,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-21 11:31:39,040 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 867 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:39,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1129 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:31:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2022-07-21 11:31:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 6299. [2022-07-21 11:31:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6299 states, 5043 states have (on average 1.403926234384295) internal successors, (7080), 5166 states have internal predecessors, (7080), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2022-07-21 11:31:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 8665 transitions. [2022-07-21 11:31:39,436 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 8665 transitions. Word has length 135 [2022-07-21 11:31:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:39,437 INFO L495 AbstractCegarLoop]: Abstraction has 6299 states and 8665 transitions. [2022-07-21 11:31:39,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:31:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 8665 transitions. [2022-07-21 11:31:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 11:31:39,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:39,452 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:39,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 11:31:39,452 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 862404707, now seen corresponding path program 1 times [2022-07-21 11:31:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:39,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631158477] [2022-07-21 11:31:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:31:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-21 11:31:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 11:31:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 11:31:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 11:31:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 11:31:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 11:31:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631158477] [2022-07-21 11:31:39,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631158477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:39,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:39,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 11:31:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730317808] [2022-07-21 11:31:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:39,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 11:31:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:39,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 11:31:39,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:31:39,682 INFO L87 Difference]: Start difference. First operand 6299 states and 8665 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:40,888 INFO L93 Difference]: Finished difference Result 16405 states and 23360 transitions. [2022-07-21 11:31:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:31:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 139 [2022-07-21 11:31:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:40,923 INFO L225 Difference]: With dead ends: 16405 [2022-07-21 11:31:40,923 INFO L226 Difference]: Without dead ends: 10126 [2022-07-21 11:31:40,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:31:40,943 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 735 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:40,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1633 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 11:31:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2022-07-21 11:31:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 6302. [2022-07-21 11:31:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6302 states, 5046 states have (on average 1.4036860879904876) internal successors, (7083), 5169 states have internal predecessors, (7083), 795 states have call successors, (795), 465 states have call predecessors, (795), 460 states have return successors, (790), 775 states have call predecessors, (790), 790 states have call successors, (790) [2022-07-21 11:31:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6302 states to 6302 states and 8668 transitions. [2022-07-21 11:31:41,276 INFO L78 Accepts]: Start accepts. Automaton has 6302 states and 8668 transitions. Word has length 139 [2022-07-21 11:31:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:41,277 INFO L495 AbstractCegarLoop]: Abstraction has 6302 states and 8668 transitions. [2022-07-21 11:31:41,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 7 states have call predecessors, (17), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6302 states and 8668 transitions. [2022-07-21 11:31:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 11:31:41,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:31:41,292 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:41,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 11:31:41,293 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:31:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:31:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash -460523326, now seen corresponding path program 1 times [2022-07-21 11:31:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:31:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164106484] [2022-07-21 11:31:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:31:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:31:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:31:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:31:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:31:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 11:31:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 11:31:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 11:31:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 11:31:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 11:31:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 11:31:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:31:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 11:31:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:31:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 11:31:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:31:41,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164106484] [2022-07-21 11:31:41,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164106484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:31:41,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:31:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 11:31:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750594659] [2022-07-21 11:31:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:31:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 11:31:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:31:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 11:31:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 11:31:41,478 INFO L87 Difference]: Start difference. First operand 6302 states and 8668 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:31:42,310 INFO L93 Difference]: Finished difference Result 6983 states and 9558 transitions. [2022-07-21 11:31:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 11:31:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2022-07-21 11:31:42,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:31:42,312 INFO L225 Difference]: With dead ends: 6983 [2022-07-21 11:31:42,312 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 11:31:42,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 11:31:42,323 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 706 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 11:31:42,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 634 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 11:31:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 11:31:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 11:31:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 11:31:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 11:31:42,327 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2022-07-21 11:31:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:31:42,327 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 11:31:42,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:31:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 11:31:42,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 11:31:42,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 11:31:42,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 11:31:42,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-21 11:35:03,052 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2022-07-21 11:35:03,052 INFO L899 garLoopResultBuilder]: For program point _torture_stop_kthreadFINAL(lines 2972 2974) no Hoare annotation was computed. [2022-07-21 11:35:03,052 INFO L902 garLoopResultBuilder]: At program point _torture_stop_kthreadENTRY(lines 2972 2974) the Hoare annotation is: true [2022-07-21 11:35:03,053 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2022-07-21 11:35:03,053 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2022-07-21 11:35:03,053 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 3078 3080) no Hoare annotation was computed. [2022-07-21 11:35:03,053 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2022-07-21 11:35:03,053 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_delayENTRY(lines 2087 2112) the Hoare annotation is: true [2022-07-21 11:35:03,053 INFO L899 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2022-07-21 11:35:03,054 INFO L902 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: true [2022-07-21 11:35:03,054 INFO L902 garLoopResultBuilder]: At program point L2100(lines 2096 2108) the Hoare annotation is: true [2022-07-21 11:35:03,054 INFO L899 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2022-07-21 11:35:03,054 INFO L899 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2022-07-21 11:35:03,054 INFO L899 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2022-07-21 11:35:03,054 INFO L902 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2022-07-21 11:35:03,054 INFO L899 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2022-07-21 11:35:03,055 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2022-07-21 11:35:03,055 INFO L895 garLoopResultBuilder]: At program point L2865(line 2865) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,055 INFO L895 garLoopResultBuilder]: At program point L1929(lines 1925 1931) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,055 INFO L895 garLoopResultBuilder]: At program point L2966(lines 2965 2967) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,055 INFO L899 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2182 2188) no Hoare annotation was computed. [2022-07-21 11:35:03,055 INFO L895 garLoopResultBuilder]: At program point torture_lock_spin_write_unlock_irqENTRY(lines 2182 2188) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,056 INFO L895 garLoopResultBuilder]: At program point L2867(lines 2862 2869) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,056 INFO L899 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 2953 2955) no Hoare annotation was computed. [2022-07-21 11:35:03,056 INFO L899 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2022-07-21 11:35:03,056 INFO L902 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 2953 2955) the Hoare annotation is: true [2022-07-21 11:35:03,056 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2009 2015) no Hoare annotation was computed. [2022-07-21 11:35:03,056 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2009 2015) the Hoare annotation is: true [2022-07-21 11:35:03,056 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2022-07-21 11:35:03,057 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2022-07-21 11:35:03,057 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockFINAL(lines 2081 2086) no Hoare annotation was computed. [2022-07-21 11:35:03,057 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_lockENTRY(lines 2081 2086) the Hoare annotation is: true [2022-07-21 11:35:03,057 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2022-07-21 11:35:03,057 INFO L895 garLoopResultBuilder]: At program point kmallocENTRY(lines 2871 2878) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 11:35:03,057 INFO L895 garLoopResultBuilder]: At program point L1937(line 1937) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 11:35:03,057 INFO L899 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2022-07-21 11:35:03,058 INFO L902 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: true [2022-07-21 11:35:03,058 INFO L895 garLoopResultBuilder]: At program point L2874(line 2874) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 11:35:03,058 INFO L902 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2022-07-21 11:35:03,058 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 2871 2878) no Hoare annotation was computed. [2022-07-21 11:35:03,058 INFO L899 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2022-07-21 11:35:03,058 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2022-07-21 11:35:03,058 INFO L899 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2022-07-21 11:35:03,058 INFO L902 garLoopResultBuilder]: At program point torture_randomENTRY(lines 3056 3058) the Hoare annotation is: true [2022-07-21 11:35:03,059 INFO L899 garLoopResultBuilder]: For program point torture_randomFINAL(lines 3056 3058) no Hoare annotation was computed. [2022-07-21 11:35:03,059 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2022-07-21 11:35:03,059 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2016 2022) the Hoare annotation is: true [2022-07-21 11:35:03,059 INFO L902 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2022-07-21 11:35:03,059 INFO L899 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2022-07-21 11:35:03,059 INFO L899 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2022-07-21 11:35:03,059 INFO L899 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2022-07-21 11:35:03,060 INFO L899 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2022-07-21 11:35:03,060 INFO L902 garLoopResultBuilder]: At program point L2307-2(lines 2265 2313) the Hoare annotation is: true [2022-07-21 11:35:03,060 INFO L899 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2022-07-21 11:35:03,060 INFO L899 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2022-07-21 11:35:03,060 INFO L902 garLoopResultBuilder]: At program point L1903(lines 1899 1905) the Hoare annotation is: true [2022-07-21 11:35:03,060 INFO L899 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2022-07-21 11:35:03,060 INFO L899 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2022-07-21 11:35:03,060 INFO L899 garLoopResultBuilder]: For program point L2304(line 2304) no Hoare annotation was computed. [2022-07-21 11:35:03,061 INFO L899 garLoopResultBuilder]: For program point L2304-2(lines 2303 2305) no Hoare annotation was computed. [2022-07-21 11:35:03,061 INFO L895 garLoopResultBuilder]: At program point lock_torture_stats_printENTRY(lines 2314 2333) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 11:35:03,061 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2022-07-21 11:35:03,061 INFO L902 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2022-07-21 11:35:03,061 INFO L899 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2022-07-21 11:35:03,061 INFO L895 garLoopResultBuilder]: At program point L2321(line 2321) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-21 11:35:03,062 INFO L899 garLoopResultBuilder]: For program point L2305-1(line 2305) no Hoare annotation was computed. [2022-07-21 11:35:03,062 INFO L899 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2022-07-21 11:35:03,062 INFO L902 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2022-07-21 11:35:03,062 INFO L902 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2022-07-21 11:35:03,062 INFO L899 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2022-07-21 11:35:03,062 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2022-07-21 11:35:03,062 INFO L902 garLoopResultBuilder]: At program point lock_torture_print_module_parmsENTRY(lines 2361 2370) the Hoare annotation is: true [2022-07-21 11:35:03,062 INFO L899 garLoopResultBuilder]: For program point lock_torture_print_module_parmsFINAL(lines 2361 2370) no Hoare annotation was computed. [2022-07-21 11:35:03,063 INFO L899 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2022-07-21 11:35:03,063 INFO L902 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2022-07-21 11:35:03,063 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2022-07-21 11:35:03,063 INFO L899 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2022-07-21 11:35:03,063 INFO L902 garLoopResultBuilder]: At program point L2957(lines 2956 2958) the Hoare annotation is: true [2022-07-21 11:35:03,063 INFO L899 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2022-07-21 11:35:03,063 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_delayENTRY(lines 2130 2163) the Hoare annotation is: true [2022-07-21 11:35:03,064 INFO L902 garLoopResultBuilder]: At program point L2146(lines 2142 2154) the Hoare annotation is: true [2022-07-21 11:35:03,064 INFO L899 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2022-07-21 11:35:03,064 INFO L902 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2022-07-21 11:35:03,064 INFO L899 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2022-07-21 11:35:03,064 INFO L899 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2022-07-21 11:35:03,064 INFO L902 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: true [2022-07-21 11:35:03,064 INFO L899 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2022-07-21 11:35:03,065 INFO L899 garLoopResultBuilder]: For program point L2399(line 2399) no Hoare annotation was computed. [2022-07-21 11:35:03,065 INFO L895 garLoopResultBuilder]: At program point L3031(lines 3030 3032) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-07-21 11:35:03,065 INFO L895 garLoopResultBuilder]: At program point L2391(lines 2383 2396) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-07-21 11:35:03,065 INFO L895 garLoopResultBuilder]: At program point L2389(lines 2383 2396) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-07-21 11:35:03,065 INFO L899 garLoopResultBuilder]: For program point L2387(line 2387) no Hoare annotation was computed. [2022-07-21 11:35:03,065 INFO L899 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2022-07-21 11:35:03,065 INFO L902 garLoopResultBuilder]: At program point L2383-2(lines 2383 2397) the Hoare annotation is: true [2022-07-21 11:35:03,066 INFO L899 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2022-07-21 11:35:03,066 INFO L902 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2022-07-21 11:35:03,066 INFO L902 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2022-07-21 11:35:03,066 INFO L902 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2022-07-21 11:35:03,066 INFO L899 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2022-07-21 11:35:03,066 INFO L899 garLoopResultBuilder]: For program point L2408-1(lines 2371 2413) no Hoare annotation was computed. [2022-07-21 11:35:03,066 INFO L895 garLoopResultBuilder]: At program point lock_torture_cleanupENTRY(lines 2371 2413) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-07-21 11:35:03,067 INFO L902 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2022-07-21 11:35:03,067 INFO L902 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2022-07-21 11:35:03,067 INFO L895 garLoopResultBuilder]: At program point L2394(line 2394) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_spin~0 0))) (.cse1 (not (<= (+ ~nwriters_stress~0 1) 0)))) (and (or .cse0 .cse1 (not (= ~ldv_state_variable_0~0 1)) (and (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset))) (or .cse0 .cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-07-21 11:35:03,067 INFO L899 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2022-07-21 11:35:03,067 INFO L902 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2022-07-21 11:35:03,067 INFO L899 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2022-07-21 11:35:03,067 INFO L902 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2022-07-21 11:35:03,068 INFO L899 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2022-07-21 11:35:03,068 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 1956 1958) the Hoare annotation is: true [2022-07-21 11:35:03,068 INFO L899 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2022-07-21 11:35:03,068 INFO L899 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2022-07-21 11:35:03,068 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2022-07-21 11:35:03,068 INFO L895 garLoopResultBuilder]: At program point ldv_spin_unlockENTRY(lines 2929 2935) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,068 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockFINAL(lines 2929 2935) no Hoare annotation was computed. [2022-07-21 11:35:03,069 INFO L899 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2022-07-21 11:35:03,069 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2022-07-21 11:35:03,069 INFO L902 garLoopResultBuilder]: At program point ldv_spin_lockENTRY(lines 2922 2928) the Hoare annotation is: true [2022-07-21 11:35:03,069 INFO L899 garLoopResultBuilder]: For program point ldv_spin_lockFINAL(lines 2922 2928) no Hoare annotation was computed. [2022-07-21 11:35:03,069 INFO L899 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2022-07-21 11:35:03,069 INFO L902 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2022-07-21 11:35:03,069 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2022-07-21 11:35:03,070 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_lock_irqENTRY(lines 2173 2181) the Hoare annotation is: true [2022-07-21 11:35:03,070 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2173 2181) no Hoare annotation was computed. [2022-07-21 11:35:03,070 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-21 11:35:03,070 INFO L899 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2022-07-21 11:35:03,070 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2022-07-21 11:35:03,070 INFO L902 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2022-07-21 11:35:03,070 INFO L899 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2022-07-21 11:35:03,071 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2022-07-21 11:35:03,071 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadFINAL(lines 2969 2971) no Hoare annotation was computed. [2022-07-21 11:35:03,071 INFO L902 garLoopResultBuilder]: At program point _torture_create_kthreadENTRY(lines 2969 2971) the Hoare annotation is: true [2022-07-21 11:35:03,071 INFO L899 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2022-07-21 11:35:03,071 INFO L899 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2022-07-21 11:35:03,071 INFO L902 garLoopResultBuilder]: At program point L2960(lines 2959 2961) the Hoare annotation is: true [2022-07-21 11:35:03,071 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockFINAL(lines 2123 2129) no Hoare annotation was computed. [2022-07-21 11:35:03,072 INFO L902 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2022-07-21 11:35:03,072 INFO L902 garLoopResultBuilder]: At program point torture_spin_lock_write_lockENTRY(lines 2123 2129) the Hoare annotation is: true [2022-07-21 11:35:03,072 INFO L902 garLoopResultBuilder]: At program point L1913(lines 1909 1915) the Hoare annotation is: true [2022-07-21 11:35:03,072 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2022-07-21 11:35:03,072 INFO L902 garLoopResultBuilder]: At program point L2851(lines 2846 2853) the Hoare annotation is: true [2022-07-21 11:35:03,072 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,072 INFO L899 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,073 INFO L899 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,073 INFO L895 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,073 INFO L899 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,073 INFO L895 garLoopResultBuilder]: At program point ##fun~~TO~VOIDENTRY(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,073 INFO L895 garLoopResultBuilder]: At program point L-1-6(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,073 INFO L895 garLoopResultBuilder]: At program point L-1-8(line -1) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= |old(~ldv_spin~0)| 0)) (and (= |old(#length)| |#length|) (= ~ldv_spin~0 0) (= ~writer_tasks~0.base |old(~writer_tasks~0.base)|) (= |old(#valid)| |#valid|) (= |old(~writer_tasks~0.offset)| ~writer_tasks~0.offset)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,074 INFO L899 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,074 INFO L899 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2022-07-21 11:35:03,074 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,074 INFO L899 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2022-07-21 11:35:03,074 INFO L895 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 1976 1992) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,074 INFO L902 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2022-07-21 11:35:03,074 INFO L899 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2022-07-21 11:35:03,074 INFO L899 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2022-07-21 11:35:03,075 INFO L895 garLoopResultBuilder]: At program point L1921(lines 1917 1923) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,075 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2022-07-21 11:35:03,075 INFO L895 garLoopResultBuilder]: At program point torture_spin_lock_write_unlockENTRY(lines 2164 2170) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,075 INFO L899 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockFINAL(lines 2164 2170) no Hoare annotation was computed. [2022-07-21 11:35:03,075 INFO L895 garLoopResultBuilder]: At program point L2859(lines 2854 2861) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,075 INFO L899 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2022-07-21 11:35:03,076 INFO L895 garLoopResultBuilder]: At program point L2857(line 2857) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (= ~ldv_spin~0 |old(~ldv_spin~0)|) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,076 INFO L895 garLoopResultBuilder]: At program point L2963(lines 2962 2964) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 0)) (not (= ~onoff_interval~0 0)) (not (= 0 ~lwsa~0.base)) (not (<= (+ ~nwriters_stress~0 1) 0)) (= ~ldv_spin~0 0) (not (= ~ldv_state_variable_0~0 1)) (not (= ~ldv_state_variable_2~0 0)) (not (= ~lwsa~0.offset 0))) [2022-07-21 11:35:03,076 INFO L902 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2022-07-21 11:35:03,076 INFO L899 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2022-07-21 11:35:03,076 INFO L899 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2022-07-21 11:35:03,076 INFO L895 garLoopResultBuilder]: At program point L2612(line 2612) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,076 INFO L899 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2022-07-21 11:35:03,077 INFO L899 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2022-07-21 11:35:03,077 INFO L899 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2022-07-21 11:35:03,077 INFO L899 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2022-07-21 11:35:03,077 INFO L895 garLoopResultBuilder]: At program point L2745(line 2745) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,077 INFO L899 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2022-07-21 11:35:03,077 INFO L899 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2022-07-21 11:35:03,077 INFO L895 garLoopResultBuilder]: At program point L2614(line 2614) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,078 INFO L899 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2022-07-21 11:35:03,078 INFO L899 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2022-07-21 11:35:03,078 INFO L902 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2022-07-21 11:35:03,078 INFO L899 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2022-07-21 11:35:03,078 INFO L895 garLoopResultBuilder]: At program point L2582(line 2582) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-21 11:35:03,078 INFO L895 garLoopResultBuilder]: At program point L2450(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,078 INFO L899 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L902 garLoopResultBuilder]: At program point L2979(lines 2978 2980) the Hoare annotation is: true [2022-07-21 11:35:03,079 INFO L899 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L899 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L899 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L899 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L899 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L899 garLoopResultBuilder]: For program point L2484(line 2484) no Hoare annotation was computed. [2022-07-21 11:35:03,079 INFO L895 garLoopResultBuilder]: At program point L1890(lines 1885 1892) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,080 INFO L899 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2022-07-21 11:35:03,080 INFO L895 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2022-07-21 11:35:03,080 INFO L899 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2022-07-21 11:35:03,080 INFO L895 garLoopResultBuilder]: At program point L2584(lines 2414 2586) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 1)) (.cse1 (<= (+ ~nwriters_stress~0 1) 0))) (or (and .cse0 (<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 16) 0) .cse1) (and .cse0 (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res#1| 12) 0) .cse1))) [2022-07-21 11:35:03,080 INFO L899 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2022-07-21 11:35:03,080 INFO L899 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2022-07-21 11:35:03,080 INFO L895 garLoopResultBuilder]: At program point L2452(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,081 INFO L895 garLoopResultBuilder]: At program point L2750(line 2750) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,081 INFO L899 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2022-07-21 11:35:03,081 INFO L899 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2022-07-21 11:35:03,081 INFO L899 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2022-07-21 11:35:03,081 INFO L895 garLoopResultBuilder]: At program point L2486(line 2486) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,081 INFO L899 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2022-07-21 11:35:03,081 INFO L895 garLoopResultBuilder]: At program point L2982(lines 2981 2983) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,082 INFO L899 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2022-07-21 11:35:03,082 INFO L895 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2022-07-21 11:35:03,082 INFO L895 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2022-07-21 11:35:03,082 INFO L899 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2022-07-21 11:35:03,082 INFO L895 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2022-07-21 11:35:03,082 INFO L899 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2022-07-21 11:35:03,082 INFO L899 garLoopResultBuilder]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2022-07-21 11:35:03,082 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2022-07-21 11:35:03,083 INFO L895 garLoopResultBuilder]: At program point L2455(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,083 INFO L895 garLoopResultBuilder]: At program point L2951(lines 2950 2952) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,083 INFO L899 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2022-07-21 11:35:03,083 INFO L899 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2022-07-21 11:35:03,083 INFO L899 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2022-07-21 11:35:03,083 INFO L899 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2022-07-21 11:35:03,083 INFO L899 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2022-07-21 11:35:03,084 INFO L899 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2022-07-21 11:35:03,084 INFO L899 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2022-07-21 11:35:03,084 INFO L895 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2022-07-21 11:35:03,084 INFO L895 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2022-07-21 11:35:03,084 INFO L899 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2022-07-21 11:35:03,084 INFO L899 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2022-07-21 11:35:03,084 INFO L899 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2022-07-21 11:35:03,084 INFO L895 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-21 11:35:03,085 INFO L899 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2022-07-21 11:35:03,085 INFO L895 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2022-07-21 11:35:03,085 INFO L899 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2022-07-21 11:35:03,085 INFO L899 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2022-07-21 11:35:03,085 INFO L899 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2022-07-21 11:35:03,085 INFO L899 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2022-07-21 11:35:03,085 INFO L899 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L899 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2022-07-21 11:35:03,086 INFO L895 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2022-07-21 11:35:03,087 INFO L899 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2022-07-21 11:35:03,087 INFO L899 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2022-07-21 11:35:03,087 INFO L895 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2022-07-21 11:35:03,087 INFO L895 garLoopResultBuilder]: At program point L2726(line 2726) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,087 INFO L899 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2022-07-21 11:35:03,087 INFO L899 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2022-07-21 11:35:03,087 INFO L899 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2022-07-21 11:35:03,088 INFO L899 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2022-07-21 11:35:03,088 INFO L899 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2022-07-21 11:35:03,088 INFO L899 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2022-07-21 11:35:03,088 INFO L895 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2022-07-21 11:35:03,088 INFO L895 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-21 11:35:03,088 INFO L899 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2022-07-21 11:35:03,088 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,089 INFO L899 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2022-07-21 11:35:03,089 INFO L899 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2022-07-21 11:35:03,089 INFO L899 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2022-07-21 11:35:03,089 INFO L895 garLoopResultBuilder]: At program point L2994(lines 2993 2995) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,089 INFO L895 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2022-07-21 11:35:03,089 INFO L899 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2022-07-21 11:35:03,089 INFO L899 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2022-07-21 11:35:03,090 INFO L899 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2022-07-21 11:35:03,090 INFO L899 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2022-07-21 11:35:03,090 INFO L895 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2022-07-21 11:35:03,090 INFO L895 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2022-07-21 11:35:03,090 INFO L895 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-21 11:35:03,090 INFO L899 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2022-07-21 11:35:03,090 INFO L895 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2022-07-21 11:35:03,090 INFO L902 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2022-07-21 11:35:03,091 INFO L899 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2022-07-21 11:35:03,092 INFO L899 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2022-07-21 11:35:03,092 INFO L895 garLoopResultBuilder]: At program point L2733(line 2733) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,092 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2022-07-21 11:35:03,092 INFO L895 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2022-07-21 11:35:03,092 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,092 INFO L895 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2022-07-21 11:35:03,092 INFO L899 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2022-07-21 11:35:03,092 INFO L899 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2022-07-21 11:35:03,093 INFO L895 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2022-07-21 11:35:03,093 INFO L895 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-21 11:35:03,093 INFO L895 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2022-07-21 11:35:03,093 INFO L899 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2022-07-21 11:35:03,093 INFO L899 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2022-07-21 11:35:03,093 INFO L899 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2022-07-21 11:35:03,093 INFO L899 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L895 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2022-07-21 11:35:03,094 INFO L899 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2022-07-21 11:35:03,095 INFO L895 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2022-07-21 11:35:03,095 INFO L895 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2022-07-21 11:35:03,095 INFO L899 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2022-07-21 11:35:03,095 INFO L895 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2022-07-21 11:35:03,095 INFO L895 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2022-07-21 11:35:03,095 INFO L895 garLoopResultBuilder]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,095 INFO L902 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2022-07-21 11:35:03,096 INFO L895 garLoopResultBuilder]: At program point L2738(line 2738) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,096 INFO L899 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2022-07-21 11:35:03,096 INFO L899 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2022-07-21 11:35:03,096 INFO L899 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2022-07-21 11:35:03,096 INFO L899 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2022-07-21 11:35:03,096 INFO L899 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2022-07-21 11:35:03,096 INFO L895 garLoopResultBuilder]: At program point L1880(lines 1875 1882) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,096 INFO L902 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2022-07-21 11:35:03,097 INFO L895 garLoopResultBuilder]: At program point L2574(lines 2425 2585) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (<= (+ |ULTIMATE.start_lock_torture_init_~firsterr~0#1| 12) 0) (<= (+ ~nwriters_stress~0 1) 0)) [2022-07-21 11:35:03,097 INFO L899 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2022-07-21 11:35:03,097 INFO L899 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2022-07-21 11:35:03,097 INFO L899 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2022-07-21 11:35:03,097 INFO L895 garLoopResultBuilder]: At program point L2475(line 2475) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,097 INFO L895 garLoopResultBuilder]: At program point L2839(lines 2609 2844) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,097 INFO L902 garLoopResultBuilder]: At program point L2707(lines 2609 2844) the Hoare annotation is: true [2022-07-21 11:35:03,098 INFO L899 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2022-07-21 11:35:03,098 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-21 11:35:03,098 INFO L899 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2022-07-21 11:35:03,098 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2022-07-21 11:35:03,098 INFO L899 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2022-07-21 11:35:03,098 INFO L895 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2022-07-21 11:35:03,098 INFO L895 garLoopResultBuilder]: At program point L3006(lines 3005 3007) the Hoare annotation is: (let ((.cse0 (= ~onoff_interval~0 0)) (.cse1 (= ~ldv_state_variable_2~0 0)) (.cse2 (= ~ldv_spin~0 0)) (.cse3 (= ~ldv_state_variable_1~0 0)) (.cse4 (<= (+ ~nwriters_stress~0 1) 0))) (or (and (= ~ldv_state_variable_0~0 1) .cse0 .cse1 .cse2 .cse3 (= 0 ~lwsa~0.base) .cse4 (= ~lwsa~0.offset 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~ldv_state_variable_0~0 3)))) [2022-07-21 11:35:03,099 INFO L895 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2022-07-21 11:35:03,099 INFO L899 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2022-07-21 11:35:03,099 INFO L899 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2022-07-21 11:35:03,099 INFO L895 garLoopResultBuilder]: At program point L2610(line 2610) the Hoare annotation is: (and (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,099 INFO L899 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2022-07-21 11:35:03,099 INFO L895 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2022-07-21 11:35:03,099 INFO L899 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2022-07-21 11:35:03,100 INFO L899 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2022-07-21 11:35:03,100 INFO L895 garLoopResultBuilder]: At program point L2478-1(lines 2478 2483) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~onoff_interval~0 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_spin~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~lwsa~0.base) (<= (+ ~nwriters_stress~0 1) 0) (= ~lwsa~0.offset 0)) [2022-07-21 11:35:03,100 INFO L899 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2022-07-21 11:35:03,100 INFO L902 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2022-07-21 11:35:03,100 INFO L895 garLoopResultBuilder]: At program point L2894(line 2894) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0))) [2022-07-21 11:35:03,100 INFO L899 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2022-07-21 11:35:03,100 INFO L899 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2022-07-21 11:35:03,100 INFO L899 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2022-07-21 11:35:03,101 INFO L902 garLoopResultBuilder]: At program point ldv_check_alloc_flagsENTRY(lines 2889 2898) the Hoare annotation is: true [2022-07-21 11:35:03,104 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:35:03,106 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 11:35:03,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:35:03 BoogieIcfgContainer [2022-07-21 11:35:03,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 11:35:03,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 11:35:03,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 11:35:03,130 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 11:35:03,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:31:20" (3/4) ... [2022-07-21 11:35:03,133 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-21 11:35:03,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2022-07-21 11:35:03,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-21 11:35:03,140 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-07-21 11:35:03,141 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2022-07-21 11:35:03,142 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2022-07-21 11:35:03,162 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2022-07-21 11:35:03,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2022-07-21 11:35:03,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-21 11:35:03,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-21 11:35:03,167 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-21 11:35:03,169 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 11:35:03,170 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-21 11:35:03,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) [2022-07-21 11:35:03,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2022-07-21 11:35:03,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2022-07-21 11:35:03,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) [2022-07-21 11:35:03,284 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 11:35:03,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 11:35:03,285 INFO L158 Benchmark]: Toolchain (without parser) took 225188.88ms. Allocated memory was 62.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 39.5MB in the beginning and 579.0MB in the end (delta: -539.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-21 11:35:03,285 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.7MB in the end (delta: 51.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 11:35:03,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 965.76ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 39.2MB in the beginning and 53.3MB in the end (delta: -14.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-07-21 11:35:03,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.29ms. Allocated memory is still 88.1MB. Free memory was 53.3MB in the beginning and 47.7MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 11:35:03,287 INFO L158 Benchmark]: Boogie Preprocessor took 83.69ms. Allocated memory is still 88.1MB. Free memory was 47.7MB in the beginning and 42.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-21 11:35:03,287 INFO L158 Benchmark]: RCFGBuilder took 1209.02ms. Allocated memory is still 88.1MB. Free memory was 42.4MB in the beginning and 49.3MB in the end (delta: -6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 11:35:03,288 INFO L158 Benchmark]: TraceAbstraction took 222651.48ms. Allocated memory was 88.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 48.9MB in the beginning and 594.7MB in the end (delta: -545.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-21 11:35:03,288 INFO L158 Benchmark]: Witness Printer took 154.47ms. Allocated memory is still 1.8GB. Free memory was 594.7MB in the beginning and 579.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 11:35:03,292 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.22ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.7MB in the end (delta: 51.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 965.76ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 39.2MB in the beginning and 53.3MB in the end (delta: -14.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.29ms. Allocated memory is still 88.1MB. Free memory was 53.3MB in the beginning and 47.7MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.69ms. Allocated memory is still 88.1MB. Free memory was 47.7MB in the beginning and 42.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1209.02ms. Allocated memory is still 88.1MB. Free memory was 42.4MB in the beginning and 49.3MB in the end (delta: -6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 222651.48ms. Allocated memory was 88.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 48.9MB in the beginning and 594.7MB in the end (delta: -545.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 154.47ms. Allocated memory is still 1.8GB. Free memory was 594.7MB in the beginning and 579.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 348 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 222.6s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 200.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10957 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10534 mSDsluCounter, 19221 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11280 mSDsCounter, 4475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7184 IncrementalHoareTripleChecker+Invalid, 11659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4475 mSolverCounterUnsat, 7941 mSDtfsCounter, 7184 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19472occurred in iteration=12, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 7240 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 21749 PreInvPairs, 23013 NumberOfFragments, 1944 HoareAnnotationTreeSize, 21749 FomulaSimplifications, 8815990 FormulaSimplificationTreeSizeReduction, 196.1s HoareSimplificationTime, 139 FomulaSimplificationsInter, 1252254 FormulaSimplificationTreeSizeReductionInter, 4.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1696 NumberOfCodeBlocks, 1696 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 3201 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2130 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 463/489 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 1917]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2956]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3067]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2965]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && ldv_spin == 0) && firsterr + 12 <= 0) && nwriters_stress + 1 <= 0 - InvariantResult [Line: 1935]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2997]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3005]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3030]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 2142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2383]: Loop Invariant Derived loop invariant: (((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || !(ldv_state_variable_0 == 1)) || (writer_tasks == \old(writer_tasks) && \old(writer_tasks) == writer_tasks)) && ((!(ldv_spin == 0) || !(nwriters_stress + 1 <= 0)) || (\old(unknown-#length-unknown) == unknown-#length-unknown && \old(\valid) == \valid)) - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2096]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ((ldv_state_variable_0 == 1 && \result + 16 <= 0) && nwriters_stress + 1 <= 0) || (((ldv_state_variable_0 == 1 && firsterr + 12 <= 0) && \result + 12 <= 0) && nwriters_stress + 1 <= 0) - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2854]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2981]: Loop Invariant Derived loop invariant: ((((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2596]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 3001]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2609]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2950]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2016]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1885]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0 - InvariantResult [Line: 2993]: Loop Invariant Derived loop invariant: (((((((ldv_state_variable_0 == 1 && onoff_interval == 0) && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && 0 == lwsa) && nwriters_stress + 1 <= 0) && lwsa == 0) || (((((onoff_interval == 0 && ldv_state_variable_2 == 0) && ldv_spin == 0) && ldv_state_variable_1 == 0) && nwriters_stress + 1 <= 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2962]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2265]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1940]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3048]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2456]: Loop Invariant Derived loop invariant: ldv_state_variable_0 == 1 && nwriters_stress + 1 <= 0 - InvariantResult [Line: 2274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2425]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1899]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1925]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_1 == 0) || !(onoff_interval == 0)) || !(0 == lwsa)) || !(nwriters_stress + 1 <= 0)) || ldv_spin == 0) || !(ldv_state_variable_0 == 1)) || !(ldv_state_variable_2 == 0)) || !(lwsa == 0) RESULT: Ultimate proved your program to be correct! [2022-07-21 11:35:03,368 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 Writing output log to file Ultimate.log Result: TRUE