./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 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y --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.1-dev-63182f1 [2021-11-13 17:58:15,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:58:15,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:58:15,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:58:15,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:58:15,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:58:15,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:58:15,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:58:15,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:58:15,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:58:15,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:58:15,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:58:15,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:58:15,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:58:15,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:58:15,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:58:15,865 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:58:15,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:58:15,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:58:15,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:58:15,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:58:15,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:58:15,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:58:15,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:58:15,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:58:15,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:58:15,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:58:15,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:58:15,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:58:15,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:58:15,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:58:15,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:58:15,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:58:15,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:58:15,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:58:15,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:58:15,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:58:15,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:58:15,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:58:15,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:58:15,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:58:15,912 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-13 17:58:15,941 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:58:15,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:58:15,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:58:15,942 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:58:15,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 17:58:15,943 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 17:58:15,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:58:15,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:58:15,944 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:58:15,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:58:15,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:58:15,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:58:15,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 17:58:15,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 17:58:15,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 17:58:15,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 17:58:15,946 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:58:15,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 17:58:15,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:58:15,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:58:15,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 17:58:15,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:58:15,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:58:15,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 17:58:15,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 17:58:15,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:58:15,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 17:58:15,949 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 17:58:15,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-13 17:58:15,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 17:58:15,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:58:15,950 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y 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 [2021-11-13 17:58:16,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:58:16,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:58:16,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:58:16,276 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:58:16,277 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:58:16,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/../../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 [2021-11-13 17:58:16,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/data/75775b9c1/80a5f5498867440ba25d7c3d5e967658/FLAGddaee18b0 [2021-11-13 17:58:17,318 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:58:17,319 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/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 [2021-11-13 17:58:17,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/data/75775b9c1/80a5f5498867440ba25d7c3d5e967658/FLAGddaee18b0 [2021-11-13 17:58:17,873 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/data/75775b9c1/80a5f5498867440ba25d7c3d5e967658 [2021-11-13 17:58:17,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:58:17,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 17:58:17,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:58:17,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:58:17,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:58:17,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:58:17" (1/1) ... [2021-11-13 17:58:17,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de6e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:17, skipping insertion in model container [2021-11-13 17:58:17,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:58:17" (1/1) ... [2021-11-13 17:58:17,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:58:18,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:58:18,455 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-11-13 17:58:18,457 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-11-13 17:58:18,651 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/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] [2021-11-13 17:58:18,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:58:19,004 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:58:19,088 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1764] [2021-11-13 17:58:19,090 WARN L1236 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1765-1766] [2021-11-13 17:58:19,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/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] [2021-11-13 17:58:19,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:58:19,302 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:58:19,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19 WrapperNode [2021-11-13 17:58:19,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:58:19,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 17:58:19,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 17:58:19,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 17:58:19,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 17:58:19,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:58:19,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:58:19,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:58:19,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:58:19,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:58:19,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:58:19,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:58:19,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (1/1) ... [2021-11-13 17:58:19,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:58:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:58:19,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 17:58:19,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 17:58:19,773 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2021-11-13 17:58:19,773 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2021-11-13 17:58:19,773 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2021-11-13 17:58:19,774 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2021-11-13 17:58:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-13 17:58:19,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-13 17:58:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 17:58:19,774 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2021-11-13 17:58:19,775 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2021-11-13 17:58:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2021-11-13 17:58:19,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2021-11-13 17:58:19,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-13 17:58:19,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-13 17:58:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2021-11-13 17:58:19,776 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2021-11-13 17:58:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2021-11-13 17:58:19,776 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2021-11-13 17:58:19,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-11-13 17:58:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-11-13 17:58:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-13 17:58:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-13 17:58:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2021-11-13 17:58:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2021-11-13 17:58:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 17:58:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-13 17:58:19,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-13 17:58:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2021-11-13 17:58:19,778 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2021-11-13 17:58:19,779 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2021-11-13 17:58:19,779 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2021-11-13 17:58:19,779 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2021-11-13 17:58:19,779 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2021-11-13 17:58:19,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-13 17:58:19,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-13 17:58:19,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-13 17:58:19,780 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2021-11-13 17:58:19,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2021-11-13 17:58:19,780 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2021-11-13 17:58:19,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2021-11-13 17:58:19,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-13 17:58:19,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:58:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2021-11-13 17:58:19,782 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2021-11-13 17:58:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-13 17:58:19,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2021-11-13 17:58:19,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2021-11-13 17:58:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2021-11-13 17:58:19,783 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2021-11-13 17:58:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:58:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-13 17:58:19,783 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2021-11-13 17:58:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2021-11-13 17:58:19,784 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-13 17:58:19,784 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-13 17:58:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2021-11-13 17:58:19,787 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2021-11-13 17:58:19,787 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2021-11-13 17:58:19,788 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2021-11-13 17:58:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:58:19,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-13 17:58:19,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-13 17:58:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2021-11-13 17:58:19,790 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2021-11-13 17:58:19,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:58:19,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:58:20,360 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-13 17:58:22,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:58:22,569 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 17:58:22,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:58:22 BoogieIcfgContainer [2021-11-13 17:58:22,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:58:22,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 17:58:22,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 17:58:22,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 17:58:22,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:58:17" (1/3) ... [2021-11-13 17:58:22,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354baf76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:58:22, skipping insertion in model container [2021-11-13 17:58:22,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:58:19" (2/3) ... [2021-11-13 17:58:22,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354baf76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:58:22, skipping insertion in model container [2021-11-13 17:58:22,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:58:22" (3/3) ... [2021-11-13 17:58:22,583 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 [2021-11-13 17:58:22,590 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 17:58:22,591 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 17:58:22,655 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 17:58:22,664 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-13 17:58:22,664 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 17:58:22,714 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) [2021-11-13 17:58:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-13 17:58:22,745 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:22,746 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:22,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1909877325, now seen corresponding path program 1 times [2021-11-13 17:58:22,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:22,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055231933] [2021-11-13 17:58:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:22,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:23,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-13 17:58:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:23,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:23,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055231933] [2021-11-13 17:58:23,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055231933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:23,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:23,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:58:23,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49561336] [2021-11-13 17:58:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:23,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:58:23,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:58:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:58:23,630 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) [2021-11-13 17:58:25,400 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:26,881 INFO L93 Difference]: Finished difference Result 1016 states and 1435 transitions. [2021-11-13 17:58:26,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:58:26,888 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 [2021-11-13 17:58:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:26,921 INFO L225 Difference]: With dead ends: 1016 [2021-11-13 17:58:26,921 INFO L226 Difference]: Without dead ends: 571 [2021-11-13 17:58:26,936 INFO L932 BasicCegarLoop]: 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 [2021-11-13 17:58:26,952 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 620 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2641.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 38.23ms SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2981.24ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:26,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [665 Valid, 959 Invalid, 545 Unknown, 0 Unchecked, 38.23ms Time], IncrementalHoareTripleChecker [179 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2981.24ms Time] [2021-11-13 17:58:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-11-13 17:58:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 524. [2021-11-13 17:58:27,100 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) [2021-11-13 17:58:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2021-11-13 17:58:27,108 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 45 [2021-11-13 17:58:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:27,109 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2021-11-13 17:58:27,109 INFO L471 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) [2021-11-13 17:58:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2021-11-13 17:58:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-13 17:58:27,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:27,116 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:27,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 17:58:27,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1822185999, now seen corresponding path program 1 times [2021-11-13 17:58:27,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:27,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603269048] [2021-11-13 17:58:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:27,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-13 17:58:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:27,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:27,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603269048] [2021-11-13 17:58:27,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603269048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:27,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:27,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:58:27,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032592139] [2021-11-13 17:58:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:27,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:58:27,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:27,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:58:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:58:27,381 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) [2021-11-13 17:58:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:30,129 INFO L93 Difference]: Finished difference Result 1271 states and 1794 transitions. [2021-11-13 17:58:30,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:58:30,130 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 [2021-11-13 17:58:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:30,139 INFO L225 Difference]: With dead ends: 1271 [2021-11-13 17:58:30,139 INFO L226 Difference]: Without dead ends: 767 [2021-11-13 17:58:30,142 INFO L932 BasicCegarLoop]: 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 [2021-11-13 17:58:30,144 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 744 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2264.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.71ms SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2596.21ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:30,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 1756 Invalid, 682 Unknown, 0 Unchecked, 23.71ms Time], IncrementalHoareTripleChecker [206 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 2596.21ms Time] [2021-11-13 17:58:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-11-13 17:58:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 525. [2021-11-13 17:58:30,240 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) [2021-11-13 17:58:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 715 transitions. [2021-11-13 17:58:30,246 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 715 transitions. Word has length 47 [2021-11-13 17:58:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:30,246 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 715 transitions. [2021-11-13 17:58:30,247 INFO L471 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) [2021-11-13 17:58:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 715 transitions. [2021-11-13 17:58:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-13 17:58:30,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:30,251 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:30,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 17:58:30,251 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -478636591, now seen corresponding path program 1 times [2021-11-13 17:58:30,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:30,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911085480] [2021-11-13 17:58:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:30,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:30,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:30,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-11-13 17:58:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:30,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:30,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911085480] [2021-11-13 17:58:30,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911085480] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:30,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:30,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:58:30,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437090621] [2021-11-13 17:58:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:30,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:58:30,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:58:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:58:30,454 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) [2021-11-13 17:58:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:32,017 INFO L93 Difference]: Finished difference Result 1074 states and 1473 transitions. [2021-11-13 17:58:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:58:32,019 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 [2021-11-13 17:58:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:32,026 INFO L225 Difference]: With dead ends: 1074 [2021-11-13 17:58:32,026 INFO L226 Difference]: Without dead ends: 569 [2021-11-13 17:58:32,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:58:32,034 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 534 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1324.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.61ms SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1400.92ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:32,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 645 Invalid, 258 Unknown, 0 Unchecked, 10.61ms Time], IncrementalHoareTripleChecker [126 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1400.92ms Time] [2021-11-13 17:58:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-11-13 17:58:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 525. [2021-11-13 17:58:32,113 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) [2021-11-13 17:58:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 714 transitions. [2021-11-13 17:58:32,118 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 714 transitions. Word has length 47 [2021-11-13 17:58:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:32,119 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 714 transitions. [2021-11-13 17:58:32,119 INFO L471 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) [2021-11-13 17:58:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 714 transitions. [2021-11-13 17:58:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-13 17:58:32,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:32,124 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:32,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 17:58:32,124 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -457513191, now seen corresponding path program 1 times [2021-11-13 17:58:32,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:32,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155693227] [2021-11-13 17:58:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:32,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:32,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:32,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:58:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:32,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:32,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155693227] [2021-11-13 17:58:32,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155693227] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:32,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:32,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:58:32,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204101444] [2021-11-13 17:58:32,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:32,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:58:32,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:32,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:58:32,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:58:32,290 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) [2021-11-13 17:58:33,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:34,713 INFO L93 Difference]: Finished difference Result 1054 states and 1484 transitions. [2021-11-13 17:58:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:58:34,714 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 [2021-11-13 17:58:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:34,724 INFO L225 Difference]: With dead ends: 1054 [2021-11-13 17:58:34,724 INFO L226 Difference]: Without dead ends: 1025 [2021-11-13 17:58:34,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:58:34,726 INFO L933 BasicCegarLoop]: 499 mSDtfsCounter, 592 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2018.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.05ms SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2205.28ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:34,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 1000 Invalid, 521 Unknown, 0 Unchecked, 15.05ms Time], IncrementalHoareTripleChecker [194 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 2205.28ms Time] [2021-11-13 17:58:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2021-11-13 17:58:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 932. [2021-11-13 17:58:34,799 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) [2021-11-13 17:58:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1305 transitions. [2021-11-13 17:58:34,807 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1305 transitions. Word has length 50 [2021-11-13 17:58:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:34,808 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1305 transitions. [2021-11-13 17:58:34,808 INFO L471 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) [2021-11-13 17:58:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1305 transitions. [2021-11-13 17:58:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 17:58:34,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:34,814 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:34,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 17:58:34,814 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 638272764, now seen corresponding path program 1 times [2021-11-13 17:58:34,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:34,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652315438] [2021-11-13 17:58:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:34,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-13 17:58:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-11-13 17:58:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:34,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:34,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652315438] [2021-11-13 17:58:34,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652315438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:34,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:34,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:58:34,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138561968] [2021-11-13 17:58:34,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:34,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:58:34,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:34,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:58:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:58:34,980 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) [2021-11-13 17:58:36,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:38,164 INFO L93 Difference]: Finished difference Result 2764 states and 3873 transitions. [2021-11-13 17:58:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:58:38,165 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 [2021-11-13 17:58:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:38,181 INFO L225 Difference]: With dead ends: 2764 [2021-11-13 17:58:38,182 INFO L226 Difference]: Without dead ends: 1852 [2021-11-13 17:58:38,187 INFO L932 BasicCegarLoop]: 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 [2021-11-13 17:58:38,188 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 1176 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2532.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.88ms SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2898.02ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:38,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1156 Invalid, 1044 Unknown, 0 Unchecked, 19.88ms Time], IncrementalHoareTripleChecker [567 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2898.02ms Time] [2021-11-13 17:58:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2021-11-13 17:58:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1659. [2021-11-13 17:58:38,351 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) [2021-11-13 17:58:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2312 transitions. [2021-11-13 17:58:38,366 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2312 transitions. Word has length 65 [2021-11-13 17:58:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:38,366 INFO L470 AbstractCegarLoop]: Abstraction has 1659 states and 2312 transitions. [2021-11-13 17:58:38,367 INFO L471 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) [2021-11-13 17:58:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2312 transitions. [2021-11-13 17:58:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-13 17:58:38,373 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:38,373 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:38,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 17:58:38,374 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:38,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1750010362, now seen corresponding path program 1 times [2021-11-13 17:58:38,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:38,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601098825] [2021-11-13 17:58:38,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:38,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 17:58:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 17:58:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-13 17:58:38,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:38,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601098825] [2021-11-13 17:58:38,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601098825] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:38,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:38,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:58:38,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522564910] [2021-11-13 17:58:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:38,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:58:38,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:58:38,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:58:38,592 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) [2021-11-13 17:58:39,694 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:41,293 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:43,458 INFO L93 Difference]: Finished difference Result 3474 states and 4860 transitions. [2021-11-13 17:58:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:58:43,459 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 [2021-11-13 17:58:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:43,475 INFO L225 Difference]: With dead ends: 3474 [2021-11-13 17:58:43,475 INFO L226 Difference]: Without dead ends: 1803 [2021-11-13 17:58:43,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:58:43,481 INFO L933 BasicCegarLoop]: 416 mSDtfsCounter, 434 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4197.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.87ms SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4641.72ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:43,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 1415 Invalid, 813 Unknown, 0 Unchecked, 14.87ms Time], IncrementalHoareTripleChecker [263 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 4641.72ms Time] [2021-11-13 17:58:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2021-11-13 17:58:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1639. [2021-11-13 17:58:43,598 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) [2021-11-13 17:58:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2272 transitions. [2021-11-13 17:58:43,617 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2272 transitions. Word has length 73 [2021-11-13 17:58:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:43,618 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2272 transitions. [2021-11-13 17:58:43,619 INFO L471 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) [2021-11-13 17:58:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2272 transitions. [2021-11-13 17:58:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-13 17:58:43,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:43,622 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:43,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 17:58:43,622 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:43,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1924223221, now seen corresponding path program 1 times [2021-11-13 17:58:43,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:43,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758879482] [2021-11-13 17:58:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:43,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-11-13 17:58:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-13 17:58:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:43,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:43,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758879482] [2021-11-13 17:58:43,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758879482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:43,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:43,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:58:43,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204690019] [2021-11-13 17:58:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:43,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:58:43,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:43,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:58:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:58:43,814 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) [2021-11-13 17:58:44,851 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:45,979 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:47,599 INFO L93 Difference]: Finished difference Result 4908 states and 6816 transitions. [2021-11-13 17:58:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:58:47,600 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 [2021-11-13 17:58:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:47,628 INFO L225 Difference]: With dead ends: 4908 [2021-11-13 17:58:47,628 INFO L226 Difference]: Without dead ends: 3289 [2021-11-13 17:58:47,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:58:47,637 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 772 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3073.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.13ms SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3465.22ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:47,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [807 Valid, 1272 Invalid, 854 Unknown, 0 Unchecked, 17.13ms Time], IncrementalHoareTripleChecker [345 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 3465.22ms Time] [2021-11-13 17:58:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2021-11-13 17:58:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 2936. [2021-11-13 17:58:47,868 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) [2021-11-13 17:58:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4048 transitions. [2021-11-13 17:58:47,893 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4048 transitions. Word has length 71 [2021-11-13 17:58:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:47,893 INFO L470 AbstractCegarLoop]: Abstraction has 2936 states and 4048 transitions. [2021-11-13 17:58:47,893 INFO L471 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) [2021-11-13 17:58:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4048 transitions. [2021-11-13 17:58:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-13 17:58:47,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:47,901 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:47,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 17:58:47,902 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:47,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1077933097, now seen corresponding path program 1 times [2021-11-13 17:58:47,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:47,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100319163] [2021-11-13 17:58:47,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:47,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:58:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:58:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:58:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-13 17:58:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:58:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-13 17:58:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-13 17:58:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:48,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:48,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100319163] [2021-11-13 17:58:48,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100319163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:48,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:48,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:58:48,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914943542] [2021-11-13 17:58:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:48,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:58:48,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:58:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:58:48,212 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) [2021-11-13 17:58:50,860 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:58:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:52,961 INFO L93 Difference]: Finished difference Result 7847 states and 10900 transitions. [2021-11-13 17:58:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:58:52,962 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 [2021-11-13 17:58:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:53,006 INFO L225 Difference]: With dead ends: 7847 [2021-11-13 17:58:53,006 INFO L226 Difference]: Without dead ends: 4931 [2021-11-13 17:58:53,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:58:53,018 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 1054 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3745.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.31ms SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4250.16ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:53,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 1646 Invalid, 1267 Unknown, 0 Unchecked, 21.31ms Time], IncrementalHoareTripleChecker [644 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 4250.16ms Time] [2021-11-13 17:58:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2021-11-13 17:58:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4414. [2021-11-13 17:58:53,382 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) [2021-11-13 17:58:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4414 states to 4414 states and 6064 transitions. [2021-11-13 17:58:53,408 INFO L78 Accepts]: Start accepts. Automaton has 4414 states and 6064 transitions. Word has length 117 [2021-11-13 17:58:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:53,409 INFO L470 AbstractCegarLoop]: Abstraction has 4414 states and 6064 transitions. [2021-11-13 17:58:53,409 INFO L471 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) [2021-11-13 17:58:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4414 states and 6064 transitions. [2021-11-13 17:58:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-13 17:58:53,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:53,419 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:58:53,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 17:58:53,420 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1717722878, now seen corresponding path program 1 times [2021-11-13 17:58:53,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:53,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623729822] [2021-11-13 17:58:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:53,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:58:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:58:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:58:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:58:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:58:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:58:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-13 17:58:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:58:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-13 17:58:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:58:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2021-11-13 17:58:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:58:53,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:53,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623729822] [2021-11-13 17:58:53,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623729822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:58:53,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:58:53,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:58:53,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439485032] [2021-11-13 17:58:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:58:53,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:58:53,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:58:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:58:53,667 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) [2021-11-13 17:58:55,960 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:00,137 INFO L93 Difference]: Finished difference Result 11777 states and 16307 transitions. [2021-11-13 17:59:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:59:00,138 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 [2021-11-13 17:59:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:00,205 INFO L225 Difference]: With dead ends: 11777 [2021-11-13 17:59:00,206 INFO L226 Difference]: Without dead ends: 7383 [2021-11-13 17:59:00,222 INFO L932 BasicCegarLoop]: 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 [2021-11-13 17:59:00,223 INFO L933 BasicCegarLoop]: 744 mSDtfsCounter, 756 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5200.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.48ms SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5861.43ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:00,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 1967 Invalid, 1203 Unknown, 0 Unchecked, 20.48ms Time], IncrementalHoareTripleChecker [417 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 5861.43ms Time] [2021-11-13 17:59:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7383 states. [2021-11-13 17:59:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7383 to 6624. [2021-11-13 17:59:00,774 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) [2021-11-13 17:59:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 9069 transitions. [2021-11-13 17:59:00,820 INFO L78 Accepts]: Start accepts. Automaton has 6624 states and 9069 transitions. Word has length 123 [2021-11-13 17:59:00,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:00,822 INFO L470 AbstractCegarLoop]: Abstraction has 6624 states and 9069 transitions. [2021-11-13 17:59:00,824 INFO L471 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) [2021-11-13 17:59:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6624 states and 9069 transitions. [2021-11-13 17:59:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-13 17:59:00,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:59:00,835 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:59:00,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 17:59:00,836 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:59:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:59:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 723546157, now seen corresponding path program 1 times [2021-11-13 17:59:00,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:59:00,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243420169] [2021-11-13 17:59:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:00,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:59:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:59:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:59:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:59:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:59:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:59:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:59:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-13 17:59:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:59:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-13 17:59:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-11-13 17:59:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 17:59:01,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:59:01,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243420169] [2021-11-13 17:59:01,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243420169] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:59:01,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689127318] [2021-11-13 17:59:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:01,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:59:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:59:01,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:59:01,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 17:59:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:01,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 17:59:01,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:59:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-13 17:59:02,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:59:02,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689127318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:59:02,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:59:02,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2021-11-13 17:59:02,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764380145] [2021-11-13 17:59:02,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:59:02,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:59:02,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:59:02,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:59:02,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-13 17:59:02,265 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) [2021-11-13 17:59:03,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:04,052 INFO L93 Difference]: Finished difference Result 13336 states and 18277 transitions. [2021-11-13 17:59:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:59:04,052 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 [2021-11-13 17:59:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:04,160 INFO L225 Difference]: With dead ends: 13336 [2021-11-13 17:59:04,167 INFO L226 Difference]: Without dead ends: 6606 [2021-11-13 17:59:04,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:59:04,191 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 6 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1181.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.41ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1320.65ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:04,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 1767 Invalid, 35 Unknown, 0 Unchecked, 4.41ms Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 1320.65ms Time] [2021-11-13 17:59:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2021-11-13 17:59:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6606. [2021-11-13 17:59:04,722 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) [2021-11-13 17:59:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 9024 transitions. [2021-11-13 17:59:04,760 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 9024 transitions. Word has length 127 [2021-11-13 17:59:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:04,761 INFO L470 AbstractCegarLoop]: Abstraction has 6606 states and 9024 transitions. [2021-11-13 17:59:04,761 INFO L471 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) [2021-11-13 17:59:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 9024 transitions. [2021-11-13 17:59:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-13 17:59:04,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:59:04,774 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:59:04,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-13 17:59:04,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-13 17:59:04,999 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:59:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:59:04,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1165331384, now seen corresponding path program 1 times [2021-11-13 17:59:04,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:59:04,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119792974] [2021-11-13 17:59:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:05,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:59:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:59:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:59:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:59:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:59:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:59:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:59:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-13 17:59:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-13 17:59:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-13 17:59:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-11-13 17:59:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:05,279 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-13 17:59:05,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:59:05,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119792974] [2021-11-13 17:59:05,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119792974] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:59:05,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:59:05,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:59:05,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293568960] [2021-11-13 17:59:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:59:05,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:59:05,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:59:05,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:59:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:59:05,284 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) [2021-11-13 17:59:07,313 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:08,414 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:10,971 INFO L93 Difference]: Finished difference Result 13880 states and 19040 transitions. [2021-11-13 17:59:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:59:10,972 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 [2021-11-13 17:59:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:11,030 INFO L225 Difference]: With dead ends: 13880 [2021-11-13 17:59:11,031 INFO L226 Difference]: Without dead ends: 7294 [2021-11-13 17:59:11,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:59:11,051 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 721 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4446.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.76ms SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5034.03ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:11,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 1216 Invalid, 682 Unknown, 0 Unchecked, 11.76ms Time], IncrementalHoareTripleChecker [311 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 5034.03ms Time] [2021-11-13 17:59:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2021-11-13 17:59:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6570. [2021-11-13 17:59:11,544 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) [2021-11-13 17:59:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 8952 transitions. [2021-11-13 17:59:11,573 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 8952 transitions. Word has length 129 [2021-11-13 17:59:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:11,574 INFO L470 AbstractCegarLoop]: Abstraction has 6570 states and 8952 transitions. [2021-11-13 17:59:11,575 INFO L471 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) [2021-11-13 17:59:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 8952 transitions. [2021-11-13 17:59:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-13 17:59:11,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:59:11,588 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:59:11,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 17:59:11,589 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:59:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:59:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -985966780, now seen corresponding path program 1 times [2021-11-13 17:59:11,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:59:11,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090058558] [2021-11-13 17:59:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:11,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:59:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:59:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:59:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:59:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:59:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:59:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:59:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:59:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-13 17:59:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:12,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-13 17:59:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:12,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-13 17:59:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 17:59:12,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:59:12,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090058558] [2021-11-13 17:59:12,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090058558] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:59:12,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701950510] [2021-11-13 17:59:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:12,056 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:59:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:59:12,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:59:12,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 17:59:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:12,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 17:59:12,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:59:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 17:59:12,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:59:12,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701950510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:59:12,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:59:12,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2021-11-13 17:59:12,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79498811] [2021-11-13 17:59:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:59:12,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:59:12,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:59:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:59:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:59:12,983 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) [2021-11-13 17:59:14,148 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:15,331 INFO L93 Difference]: Finished difference Result 19649 states and 26785 transitions. [2021-11-13 17:59:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:59:15,332 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 [2021-11-13 17:59:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:15,471 INFO L225 Difference]: With dead ends: 19649 [2021-11-13 17:59:15,471 INFO L226 Difference]: Without dead ends: 19622 [2021-11-13 17:59:15,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:59:15,480 INFO L933 BasicCegarLoop]: 846 mSDtfsCounter, 774 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1418.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.51ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1650.59ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:15,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 1682 Invalid, 153 Unknown, 0 Unchecked, 6.51ms Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1650.59ms Time] [2021-11-13 17:59:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19622 states. [2021-11-13 17:59:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19622 to 19472. [2021-11-13 17:59:16,973 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) [2021-11-13 17:59:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19472 states to 19472 states and 26599 transitions. [2021-11-13 17:59:17,045 INFO L78 Accepts]: Start accepts. Automaton has 19472 states and 26599 transitions. Word has length 130 [2021-11-13 17:59:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:17,045 INFO L470 AbstractCegarLoop]: Abstraction has 19472 states and 26599 transitions. [2021-11-13 17:59:17,046 INFO L471 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) [2021-11-13 17:59:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 19472 states and 26599 transitions. [2021-11-13 17:59:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-13 17:59:17,075 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:59:17,076 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:59:17,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 17:59:17,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-13 17:59:17,295 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:59:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:59:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1089963992, now seen corresponding path program 1 times [2021-11-13 17:59:17,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:59:17,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554444530] [2021-11-13 17:59:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:17,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:59:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:59:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:59:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:59:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:59:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:59:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:59:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:59:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-13 17:59:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-13 17:59:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-13 17:59:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-13 17:59:17,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:59:17,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554444530] [2021-11-13 17:59:17,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554444530] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:59:17,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:59:17,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:59:17,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855747378] [2021-11-13 17:59:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:59:17,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:59:17,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:59:17,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:59:17,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:59:17,567 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) [2021-11-13 17:59:19,586 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:20,788 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:22,322 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:24,114 INFO L93 Difference]: Finished difference Result 26068 states and 35801 transitions. [2021-11-13 17:59:24,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:59:24,116 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 [2021-11-13 17:59:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:24,243 INFO L225 Difference]: With dead ends: 26068 [2021-11-13 17:59:24,244 INFO L226 Difference]: Without dead ends: 6429 [2021-11-13 17:59:24,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:59:24,298 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 817 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 461 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5302.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.98ms SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6036.55ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:24,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 1197 Invalid, 902 Unknown, 0 Unchecked, 11.98ms Time], IncrementalHoareTripleChecker [461 Valid, 440 Invalid, 1 Unknown, 0 Unchecked, 6036.55ms Time] [2021-11-13 17:59:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6429 states. [2021-11-13 17:59:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6429 to 6299. [2021-11-13 17:59:24,634 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) [2021-11-13 17:59:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 8665 transitions. [2021-11-13 17:59:24,659 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 8665 transitions. Word has length 135 [2021-11-13 17:59:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:24,660 INFO L470 AbstractCegarLoop]: Abstraction has 6299 states and 8665 transitions. [2021-11-13 17:59:24,661 INFO L471 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) [2021-11-13 17:59:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 8665 transitions. [2021-11-13 17:59:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-13 17:59:24,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:59:24,683 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:59:24,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 17:59:24,685 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:59:24,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:59:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash 862404707, now seen corresponding path program 1 times [2021-11-13 17:59:24,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:59:24,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116016886] [2021-11-13 17:59:24,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:24,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:59:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:24,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:59:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:59:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:24,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:59:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-13 17:59:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:24,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:59:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:59:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:59:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-11-13 17:59:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-13 17:59:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-11-13 17:59:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-13 17:59:25,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:59:25,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116016886] [2021-11-13 17:59:25,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116016886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:59:25,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:59:25,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 17:59:25,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152023312] [2021-11-13 17:59:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:59:25,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 17:59:25,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:59:25,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 17:59:25,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:59:25,223 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) [2021-11-13 17:59:26,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:28,107 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:29,121 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:30,533 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:32,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:32,607 INFO L93 Difference]: Finished difference Result 16405 states and 23360 transitions. [2021-11-13 17:59:32,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:59:32,608 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 [2021-11-13 17:59:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:32,654 INFO L225 Difference]: With dead ends: 16405 [2021-11-13 17:59:32,654 INFO L226 Difference]: Without dead ends: 10126 [2021-11-13 17:59:32,672 INFO L932 BasicCegarLoop]: 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 [2021-11-13 17:59:32,673 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 671 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6049.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.94ms SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6854.61ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:32,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [707 Valid, 1736 Invalid, 1166 Unknown, 0 Unchecked, 19.94ms Time], IncrementalHoareTripleChecker [405 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 6854.61ms Time] [2021-11-13 17:59:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10126 states. [2021-11-13 17:59:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10126 to 6302. [2021-11-13 17:59:33,139 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) [2021-11-13 17:59:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6302 states to 6302 states and 8668 transitions. [2021-11-13 17:59:33,162 INFO L78 Accepts]: Start accepts. Automaton has 6302 states and 8668 transitions. Word has length 139 [2021-11-13 17:59:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:33,163 INFO L470 AbstractCegarLoop]: Abstraction has 6302 states and 8668 transitions. [2021-11-13 17:59:33,163 INFO L471 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) [2021-11-13 17:59:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6302 states and 8668 transitions. [2021-11-13 17:59:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-13 17:59:33,185 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:59:33,185 INFO L514 BasicCegarLoop]: 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] [2021-11-13 17:59:33,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 17:59:33,186 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:59:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:59:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash -460523326, now seen corresponding path program 1 times [2021-11-13 17:59:33,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:59:33,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908620977] [2021-11-13 17:59:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:59:33,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:59:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-13 17:59:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-13 17:59:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-11-13 17:59:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-13 17:59:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-13 17:59:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-11-13 17:59:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-13 17:59:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 17:59:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 17:59:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 17:59:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-13 17:59:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:59:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-13 17:59:33,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:59:33,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908620977] [2021-11-13 17:59:33,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908620977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:59:33,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:59:33,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-13 17:59:33,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305225745] [2021-11-13 17:59:33,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:59:33,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 17:59:33,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:59:33,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 17:59:33,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:59:33,594 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) [2021-11-13 17:59:34,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:36,655 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:38,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-13 17:59:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:59:40,338 INFO L93 Difference]: Finished difference Result 6983 states and 9558 transitions. [2021-11-13 17:59:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:59:40,339 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 [2021-11-13 17:59:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:59:40,339 INFO L225 Difference]: With dead ends: 6983 [2021-11-13 17:59:40,339 INFO L226 Difference]: Without dead ends: 0 [2021-11-13 17:59:40,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-11-13 17:59:40,348 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 610 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 277 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5734.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.83ms SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6374.18ms IncrementalHoareTripleChecker+Time [2021-11-13 17:59:40,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 734 Invalid, 861 Unknown, 0 Unchecked, 11.83ms Time], IncrementalHoareTripleChecker [277 Valid, 583 Invalid, 1 Unknown, 0 Unchecked, 6374.18ms Time] [2021-11-13 17:59:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-13 17:59:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-13 17:59:40,350 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) [2021-11-13 17:59:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-13 17:59:40,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2021-11-13 17:59:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:59:40,352 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:59:40,352 INFO L471 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) [2021-11-13 17:59:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-13 17:59:40,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-13 17:59:40,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 17:59:40,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-13 17:59:40,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-13 18:05:23,167 INFO L858 garLoopResultBuilder]: For program point _torture_stop_kthreadEXIT(lines 2972 2974) no Hoare annotation was computed. [2021-11-13 18:05:23,168 INFO L858 garLoopResultBuilder]: For program point _torture_stop_kthreadFINAL(lines 2972 2974) no Hoare annotation was computed. [2021-11-13 18:05:23,168 INFO L861 garLoopResultBuilder]: At program point _torture_stop_kthreadENTRY(lines 2972 2974) the Hoare annotation is: true [2021-11-13 18:05:23,168 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 3078 3080) no Hoare annotation was computed. [2021-11-13 18:05:23,168 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 3078 3080) the Hoare annotation is: (= |old(#valid)| |#valid|) [2021-11-13 18:05:23,168 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 3078 3080) no Hoare annotation was computed. [2021-11-13 18:05:23,168 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_delayEXIT(lines 2087 2112) no Hoare annotation was computed. [2021-11-13 18:05:23,168 INFO L861 garLoopResultBuilder]: At program point torture_lock_busted_write_delayENTRY(lines 2087 2112) the Hoare annotation is: true [2021-11-13 18:05:23,168 INFO L858 garLoopResultBuilder]: For program point L2104(lines 2104 2107) no Hoare annotation was computed. [2021-11-13 18:05:23,168 INFO L861 garLoopResultBuilder]: At program point L2105(lines 2096 2108) the Hoare annotation is: true [2021-11-13 18:05:23,168 INFO L861 garLoopResultBuilder]: At program point L2100(lines 2096 2108) the Hoare annotation is: true [2021-11-13 18:05:23,169 INFO L858 garLoopResultBuilder]: For program point L2096(lines 2096 2109) no Hoare annotation was computed. [2021-11-13 18:05:23,169 INFO L858 garLoopResultBuilder]: For program point L2095-1(line 2095) no Hoare annotation was computed. [2021-11-13 18:05:23,169 INFO L858 garLoopResultBuilder]: For program point L2096-2(lines 2087 2112) no Hoare annotation was computed. [2021-11-13 18:05:23,169 INFO L861 garLoopResultBuilder]: At program point L2095(line 2095) the Hoare annotation is: true [2021-11-13 18:05:23,169 INFO L858 garLoopResultBuilder]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2021-11-13 18:05:23,169 INFO L858 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2182 2188) no Hoare annotation was computed. [2021-11-13 18:05:23,169 INFO L854 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))) [2021-11-13 18:05:23,170 INFO L854 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))) [2021-11-13 18:05:23,170 INFO L854 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))) [2021-11-13 18:05:23,170 INFO L858 garLoopResultBuilder]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2182 2188) no Hoare annotation was computed. [2021-11-13 18:05:23,170 INFO L854 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))) [2021-11-13 18:05:23,170 INFO L854 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))) [2021-11-13 18:05:23,171 INFO L858 garLoopResultBuilder]: For program point __const_udelayFINAL(lines 2953 2955) no Hoare annotation was computed. [2021-11-13 18:05:23,171 INFO L858 garLoopResultBuilder]: For program point __const_udelayEXIT(lines 2953 2955) no Hoare annotation was computed. [2021-11-13 18:05:23,171 INFO L861 garLoopResultBuilder]: At program point __const_udelayENTRY(lines 2953 2955) the Hoare annotation is: true [2021-11-13 18:05:23,171 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2009 2015) no Hoare annotation was computed. [2021-11-13 18:05:23,171 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2009 2015) the Hoare annotation is: true [2021-11-13 18:05:23,172 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2013) no Hoare annotation was computed. [2021-11-13 18:05:23,172 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2009 2015) no Hoare annotation was computed. [2021-11-13 18:05:23,172 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_lockFINAL(lines 2081 2086) no Hoare annotation was computed. [2021-11-13 18:05:23,172 INFO L861 garLoopResultBuilder]: At program point torture_lock_busted_write_lockENTRY(lines 2081 2086) the Hoare annotation is: true [2021-11-13 18:05:23,172 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_lockEXIT(lines 2081 2086) no Hoare annotation was computed. [2021-11-13 18:05:23,172 INFO L854 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|))) [2021-11-13 18:05:23,173 INFO L854 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|))) [2021-11-13 18:05:23,173 INFO L858 garLoopResultBuilder]: For program point L1937-1(line 1937) no Hoare annotation was computed. [2021-11-13 18:05:23,173 INFO L861 garLoopResultBuilder]: At program point L1937-2(lines 1935 1938) the Hoare annotation is: true [2021-11-13 18:05:23,173 INFO L854 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|))) [2021-11-13 18:05:23,173 INFO L861 garLoopResultBuilder]: At program point L1945(lines 1940 1947) the Hoare annotation is: true [2021-11-13 18:05:23,174 INFO L858 garLoopResultBuilder]: For program point kmallocFINAL(lines 2871 2878) no Hoare annotation was computed. [2021-11-13 18:05:23,174 INFO L858 garLoopResultBuilder]: For program point L2874-1(line 2874) no Hoare annotation was computed. [2021-11-13 18:05:23,174 INFO L858 garLoopResultBuilder]: For program point kmallocEXIT(lines 2871 2878) no Hoare annotation was computed. [2021-11-13 18:05:23,174 INFO L858 garLoopResultBuilder]: For program point torture_randomEXIT(lines 3056 3058) no Hoare annotation was computed. [2021-11-13 18:05:23,174 INFO L861 garLoopResultBuilder]: At program point torture_randomENTRY(lines 3056 3058) the Hoare annotation is: true [2021-11-13 18:05:23,174 INFO L858 garLoopResultBuilder]: For program point torture_randomFINAL(lines 3056 3058) no Hoare annotation was computed. [2021-11-13 18:05:23,175 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2016 2022) no Hoare annotation was computed. [2021-11-13 18:05:23,175 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2016 2022) the Hoare annotation is: true [2021-11-13 18:05:23,175 INFO L861 garLoopResultBuilder]: At program point L2298(lines 2274 2312) the Hoare annotation is: true [2021-11-13 18:05:23,175 INFO L858 garLoopResultBuilder]: For program point L2323(lines 2323 2327) no Hoare annotation was computed. [2021-11-13 18:05:23,175 INFO L858 garLoopResultBuilder]: For program point L2282(lines 2282 2285) no Hoare annotation was computed. [2021-11-13 18:05:23,175 INFO L858 garLoopResultBuilder]: For program point L2282-2(lines 2282 2285) no Hoare annotation was computed. [2021-11-13 18:05:23,176 INFO L858 garLoopResultBuilder]: For program point L2307(lines 2307 2310) no Hoare annotation was computed. [2021-11-13 18:05:23,176 INFO L861 garLoopResultBuilder]: At program point L2307-2(lines 2265 2313) the Hoare annotation is: true [2021-11-13 18:05:23,176 INFO L858 garLoopResultBuilder]: For program point L2291(lines 2291 2294) no Hoare annotation was computed. [2021-11-13 18:05:23,176 INFO L858 garLoopResultBuilder]: For program point L2291-2(lines 2291 2294) no Hoare annotation was computed. [2021-11-13 18:05:23,176 INFO L861 garLoopResultBuilder]: At program point L1903(lines 1899 1905) the Hoare annotation is: true [2021-11-13 18:05:23,176 INFO L858 garLoopResultBuilder]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2021-11-13 18:05:23,177 INFO L858 garLoopResultBuilder]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2021-11-13 18:05:23,177 INFO L858 garLoopResultBuilder]: For program point L2304(line 2304) no Hoare annotation was computed. [2021-11-13 18:05:23,177 INFO L858 garLoopResultBuilder]: For program point L2304-2(lines 2303 2305) no Hoare annotation was computed. [2021-11-13 18:05:23,177 INFO L854 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|))) [2021-11-13 18:05:23,177 INFO L858 garLoopResultBuilder]: For program point lock_torture_stats_printFINAL(lines 2314 2333) no Hoare annotation was computed. [2021-11-13 18:05:23,177 INFO L861 garLoopResultBuilder]: At program point L2296(lines 2274 2312) the Hoare annotation is: true [2021-11-13 18:05:23,178 INFO L858 garLoopResultBuilder]: For program point L2321-1(line 2321) no Hoare annotation was computed. [2021-11-13 18:05:23,178 INFO L854 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|))) [2021-11-13 18:05:23,178 INFO L858 garLoopResultBuilder]: For program point L2305-1(line 2305) no Hoare annotation was computed. [2021-11-13 18:05:23,178 INFO L858 garLoopResultBuilder]: For program point lock_torture_stats_printEXIT(lines 2314 2333) no Hoare annotation was computed. [2021-11-13 18:05:23,178 INFO L861 garLoopResultBuilder]: At program point L2330(line 2330) the Hoare annotation is: true [2021-11-13 18:05:23,179 INFO L861 garLoopResultBuilder]: At program point torture_lock_busted_write_unlockFINAL(lines 2113 2118) the Hoare annotation is: true [2021-11-13 18:05:23,179 INFO L858 garLoopResultBuilder]: For program point torture_lock_busted_write_unlockEXIT(lines 2113 2118) no Hoare annotation was computed. [2021-11-13 18:05:23,179 INFO L858 garLoopResultBuilder]: For program point lock_torture_print_module_parmsEXIT(lines 2361 2370) no Hoare annotation was computed. [2021-11-13 18:05:23,179 INFO L861 garLoopResultBuilder]: At program point lock_torture_print_module_parmsENTRY(lines 2361 2370) the Hoare annotation is: true [2021-11-13 18:05:23,179 INFO L858 garLoopResultBuilder]: For program point lock_torture_print_module_parmsFINAL(lines 2361 2370) no Hoare annotation was computed. [2021-11-13 18:05:23,179 INFO L858 garLoopResultBuilder]: For program point L2141-1(line 2141) no Hoare annotation was computed. [2021-11-13 18:05:23,180 INFO L861 garLoopResultBuilder]: At program point L2141(line 2141) the Hoare annotation is: true [2021-11-13 18:05:23,180 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_delayEXIT(lines 2130 2163) no Hoare annotation was computed. [2021-11-13 18:05:23,180 INFO L858 garLoopResultBuilder]: For program point L2156(line 2156) no Hoare annotation was computed. [2021-11-13 18:05:23,180 INFO L861 garLoopResultBuilder]: At program point L2957(lines 2956 2958) the Hoare annotation is: true [2021-11-13 18:05:23,180 INFO L858 garLoopResultBuilder]: For program point L2150(lines 2150 2153) no Hoare annotation was computed. [2021-11-13 18:05:23,181 INFO L861 garLoopResultBuilder]: At program point torture_spin_lock_write_delayENTRY(lines 2130 2163) the Hoare annotation is: true [2021-11-13 18:05:23,181 INFO L861 garLoopResultBuilder]: At program point L2146(lines 2142 2154) the Hoare annotation is: true [2021-11-13 18:05:23,181 INFO L858 garLoopResultBuilder]: For program point L2142(lines 2142 2155) no Hoare annotation was computed. [2021-11-13 18:05:23,181 INFO L861 garLoopResultBuilder]: At program point L2142-2(lines 2142 2155) the Hoare annotation is: true [2021-11-13 18:05:23,181 INFO L858 garLoopResultBuilder]: For program point L2157(lines 2157 2160) no Hoare annotation was computed. [2021-11-13 18:05:23,181 INFO L858 garLoopResultBuilder]: For program point L2157-2(lines 2130 2163) no Hoare annotation was computed. [2021-11-13 18:05:23,182 INFO L861 garLoopResultBuilder]: At program point L2151(lines 2142 2154) the Hoare annotation is: true [2021-11-13 18:05:23,182 INFO L858 garLoopResultBuilder]: For program point L2401(lines 2401 2410) no Hoare annotation was computed. [2021-11-13 18:05:23,182 INFO L858 garLoopResultBuilder]: For program point L2399(line 2399) no Hoare annotation was computed. [2021-11-13 18:05:23,182 INFO L854 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|))))) [2021-11-13 18:05:23,182 INFO L854 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|))))) [2021-11-13 18:05:23,183 INFO L854 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|))))) [2021-11-13 18:05:23,183 INFO L858 garLoopResultBuilder]: For program point L2387(line 2387) no Hoare annotation was computed. [2021-11-13 18:05:23,183 INFO L858 garLoopResultBuilder]: For program point L2383(lines 2383 2397) no Hoare annotation was computed. [2021-11-13 18:05:23,183 INFO L861 garLoopResultBuilder]: At program point L2383-2(lines 2383 2397) the Hoare annotation is: true [2021-11-13 18:05:23,183 INFO L858 garLoopResultBuilder]: For program point L2379(lines 2379 2382) no Hoare annotation was computed. [2021-11-13 18:05:23,183 INFO L861 garLoopResultBuilder]: At program point L2408(line 2408) the Hoare annotation is: true [2021-11-13 18:05:23,184 INFO L861 garLoopResultBuilder]: At program point L1896(lines 1893 1898) the Hoare annotation is: true [2021-11-13 18:05:23,184 INFO L861 garLoopResultBuilder]: At program point L2406(line 2406) the Hoare annotation is: true [2021-11-13 18:05:23,184 INFO L858 garLoopResultBuilder]: For program point lock_torture_cleanupEXIT(lines 2371 2413) no Hoare annotation was computed. [2021-11-13 18:05:23,184 INFO L858 garLoopResultBuilder]: For program point L2408-1(lines 2371 2413) no Hoare annotation was computed. [2021-11-13 18:05:23,184 INFO L854 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|))))) [2021-11-13 18:05:23,185 INFO L861 garLoopResultBuilder]: At program point L2402(line 2402) the Hoare annotation is: true [2021-11-13 18:05:23,185 INFO L861 garLoopResultBuilder]: At program point L2398(line 2398) the Hoare annotation is: true [2021-11-13 18:05:23,185 INFO L854 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|))))) [2021-11-13 18:05:23,185 INFO L858 garLoopResultBuilder]: For program point L2394-1(line 2394) no Hoare annotation was computed. [2021-11-13 18:05:23,185 INFO L861 garLoopResultBuilder]: At program point L3049(lines 3048 3050) the Hoare annotation is: true [2021-11-13 18:05:23,186 INFO L858 garLoopResultBuilder]: For program point L2405(lines 2405 2409) no Hoare annotation was computed. [2021-11-13 18:05:23,186 INFO L861 garLoopResultBuilder]: At program point torture_init_endFINAL(lines 3037 3039) the Hoare annotation is: true [2021-11-13 18:05:23,186 INFO L858 garLoopResultBuilder]: For program point torture_init_endEXIT(lines 3037 3039) no Hoare annotation was computed. [2021-11-13 18:05:23,186 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 1956 1958) the Hoare annotation is: true [2021-11-13 18:05:23,186 INFO L858 garLoopResultBuilder]: For program point L1957(line 1957) no Hoare annotation was computed. [2021-11-13 18:05:23,186 INFO L858 garLoopResultBuilder]: For program point L1957-2(lines 1956 1958) no Hoare annotation was computed. [2021-11-13 18:05:23,187 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 1956 1958) no Hoare annotation was computed. [2021-11-13 18:05:23,187 INFO L854 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))) [2021-11-13 18:05:23,187 INFO L858 garLoopResultBuilder]: For program point ldv_spin_unlockFINAL(lines 2929 2935) no Hoare annotation was computed. [2021-11-13 18:05:23,187 INFO L858 garLoopResultBuilder]: For program point ldv_spin_unlockEXIT(lines 2929 2935) no Hoare annotation was computed. [2021-11-13 18:05:23,187 INFO L858 garLoopResultBuilder]: For program point ldv_spin_lockEXIT(lines 2922 2928) no Hoare annotation was computed. [2021-11-13 18:05:23,187 INFO L861 garLoopResultBuilder]: At program point ldv_spin_lockENTRY(lines 2922 2928) the Hoare annotation is: true [2021-11-13 18:05:23,188 INFO L858 garLoopResultBuilder]: For program point ldv_spin_lockFINAL(lines 2922 2928) no Hoare annotation was computed. [2021-11-13 18:05:23,188 INFO L858 garLoopResultBuilder]: For program point L2177-1(line 2177) no Hoare annotation was computed. [2021-11-13 18:05:23,188 INFO L861 garLoopResultBuilder]: At program point L2177(line 2177) the Hoare annotation is: true [2021-11-13 18:05:23,188 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2173 2181) no Hoare annotation was computed. [2021-11-13 18:05:23,188 INFO L861 garLoopResultBuilder]: At program point torture_spin_lock_write_lock_irqENTRY(lines 2173 2181) the Hoare annotation is: true [2021-11-13 18:05:23,189 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2173 2181) no Hoare annotation was computed. [2021-11-13 18:05:23,189 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 1959 1975) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-11-13 18:05:23,189 INFO L858 garLoopResultBuilder]: For program point L1966(lines 1966 1973) no Hoare annotation was computed. [2021-11-13 18:05:23,189 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 1959 1975) no Hoare annotation was computed. [2021-11-13 18:05:23,189 INFO L861 garLoopResultBuilder]: At program point L1971(line 1971) the Hoare annotation is: true [2021-11-13 18:05:23,189 INFO L858 garLoopResultBuilder]: For program point L1971-1(line 1971) no Hoare annotation was computed. [2021-11-13 18:05:23,190 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 1959 1975) no Hoare annotation was computed. [2021-11-13 18:05:23,190 INFO L858 garLoopResultBuilder]: For program point _torture_create_kthreadFINAL(lines 2969 2971) no Hoare annotation was computed. [2021-11-13 18:05:23,190 INFO L861 garLoopResultBuilder]: At program point _torture_create_kthreadENTRY(lines 2969 2971) the Hoare annotation is: true [2021-11-13 18:05:23,190 INFO L858 garLoopResultBuilder]: For program point _torture_create_kthreadEXIT(lines 2969 2971) no Hoare annotation was computed. [2021-11-13 18:05:23,190 INFO L858 garLoopResultBuilder]: For program point L2849-1(line 2849) no Hoare annotation was computed. [2021-11-13 18:05:23,190 INFO L861 garLoopResultBuilder]: At program point L2960(lines 2959 2961) the Hoare annotation is: true [2021-11-13 18:05:23,191 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lockFINAL(lines 2123 2129) no Hoare annotation was computed. [2021-11-13 18:05:23,191 INFO L861 garLoopResultBuilder]: At program point L2849(line 2849) the Hoare annotation is: true [2021-11-13 18:05:23,191 INFO L861 garLoopResultBuilder]: At program point torture_spin_lock_write_lockENTRY(lines 2123 2129) the Hoare annotation is: true [2021-11-13 18:05:23,191 INFO L861 garLoopResultBuilder]: At program point L1913(lines 1909 1915) the Hoare annotation is: true [2021-11-13 18:05:23,191 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_lockEXIT(lines 2123 2129) no Hoare annotation was computed. [2021-11-13 18:05:23,191 INFO L861 garLoopResultBuilder]: At program point L2851(lines 2846 2853) the Hoare annotation is: true [2021-11-13 18:05:23,192 INFO L854 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))) [2021-11-13 18:05:23,192 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,192 INFO L858 garLoopResultBuilder]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,192 INFO L854 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))) [2021-11-13 18:05:23,192 INFO L858 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,193 INFO L854 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))) [2021-11-13 18:05:23,193 INFO L854 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))) [2021-11-13 18:05:23,193 INFO L854 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))) [2021-11-13 18:05:23,193 INFO L858 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,193 INFO L858 garLoopResultBuilder]: For program point L1983(lines 1983 1990) no Hoare annotation was computed. [2021-11-13 18:05:23,194 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,194 INFO L858 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 1976 1992) no Hoare annotation was computed. [2021-11-13 18:05:23,194 INFO L854 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))) [2021-11-13 18:05:23,194 INFO L861 garLoopResultBuilder]: At program point L1988(line 1988) the Hoare annotation is: true [2021-11-13 18:05:23,194 INFO L858 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 1976 1992) no Hoare annotation was computed. [2021-11-13 18:05:23,194 INFO L858 garLoopResultBuilder]: For program point L1988-1(line 1988) no Hoare annotation was computed. [2021-11-13 18:05:23,195 INFO L854 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))) [2021-11-13 18:05:23,195 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockEXIT(lines 2164 2170) no Hoare annotation was computed. [2021-11-13 18:05:23,195 INFO L854 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))) [2021-11-13 18:05:23,195 INFO L858 garLoopResultBuilder]: For program point torture_spin_lock_write_unlockFINAL(lines 2164 2170) no Hoare annotation was computed. [2021-11-13 18:05:23,195 INFO L854 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))) [2021-11-13 18:05:23,195 INFO L858 garLoopResultBuilder]: For program point L2857-1(line 2857) no Hoare annotation was computed. [2021-11-13 18:05:23,196 INFO L854 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))) [2021-11-13 18:05:23,196 INFO L854 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))) [2021-11-13 18:05:23,196 INFO L861 garLoopResultBuilder]: At program point L2843(lines 2596 2845) the Hoare annotation is: true [2021-11-13 18:05:23,196 INFO L858 garLoopResultBuilder]: For program point L2744(lines 2744 2748) no Hoare annotation was computed. [2021-11-13 18:05:23,196 INFO L858 garLoopResultBuilder]: For program point L2744-2(lines 2723 2773) no Hoare annotation was computed. [2021-11-13 18:05:23,197 INFO L854 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)) [2021-11-13 18:05:23,197 INFO L858 garLoopResultBuilder]: For program point L2612-1(line 2612) no Hoare annotation was computed. [2021-11-13 18:05:23,197 INFO L858 garLoopResultBuilder]: For program point L2579(line 2579) no Hoare annotation was computed. [2021-11-13 18:05:23,197 INFO L858 garLoopResultBuilder]: For program point L2778(line 2778) no Hoare annotation was computed. [2021-11-13 18:05:23,197 INFO L858 garLoopResultBuilder]: For program point L2745-1(line 2745) no Hoare annotation was computed. [2021-11-13 18:05:23,197 INFO L854 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)))) [2021-11-13 18:05:23,198 INFO L858 garLoopResultBuilder]: For program point L2779(lines 2779 2834) no Hoare annotation was computed. [2021-11-13 18:05:23,198 INFO L858 garLoopResultBuilder]: For program point L2713(line 2713) no Hoare annotation was computed. [2021-11-13 18:05:23,198 INFO L854 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)) [2021-11-13 18:05:23,198 INFO L858 garLoopResultBuilder]: For program point L2614-1(line 2614) no Hoare annotation was computed. [2021-11-13 18:05:23,198 INFO L858 garLoopResultBuilder]: For program point L2813(line 2813) no Hoare annotation was computed. [2021-11-13 18:05:23,198 INFO L861 garLoopResultBuilder]: At program point L2714(line 2714) the Hoare annotation is: true [2021-11-13 18:05:23,199 INFO L858 garLoopResultBuilder]: For program point L2648(line 2648) no Hoare annotation was computed. [2021-11-13 18:05:23,199 INFO L854 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)) [2021-11-13 18:05:23,199 INFO L854 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)) [2021-11-13 18:05:23,199 INFO L858 garLoopResultBuilder]: For program point L2516-1(lines 2425 2585) no Hoare annotation was computed. [2021-11-13 18:05:23,199 INFO L861 garLoopResultBuilder]: At program point L2979(lines 2978 2980) the Hoare annotation is: true [2021-11-13 18:05:23,200 INFO L858 garLoopResultBuilder]: For program point L2814(lines 2814 2819) no Hoare annotation was computed. [2021-11-13 18:05:23,200 INFO L858 garLoopResultBuilder]: For program point L2781(lines 2781 2831) no Hoare annotation was computed. [2021-11-13 18:05:23,200 INFO L858 garLoopResultBuilder]: For program point L2649(lines 2649 2653) no Hoare annotation was computed. [2021-11-13 18:05:23,200 INFO L858 garLoopResultBuilder]: For program point L2649-2(lines 2628 2678) no Hoare annotation was computed. [2021-11-13 18:05:23,200 INFO L858 garLoopResultBuilder]: For program point L2583(line 2583) no Hoare annotation was computed. [2021-11-13 18:05:23,200 INFO L858 garLoopResultBuilder]: For program point L2484(line 2484) no Hoare annotation was computed. [2021-11-13 18:05:23,201 INFO L854 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)) [2021-11-13 18:05:23,201 INFO L858 garLoopResultBuilder]: For program point L2782(line 2782) no Hoare annotation was computed. [2021-11-13 18:05:23,201 INFO L854 garLoopResultBuilder]: At program point L2650(line 2650) the Hoare annotation is: false [2021-11-13 18:05:23,201 INFO L858 garLoopResultBuilder]: For program point L2683(line 2683) no Hoare annotation was computed. [2021-11-13 18:05:23,201 INFO L854 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))) [2021-11-13 18:05:23,201 INFO L858 garLoopResultBuilder]: For program point L2650-1(line 2650) no Hoare annotation was computed. [2021-11-13 18:05:23,202 INFO L858 garLoopResultBuilder]: For program point L2518(lines 2518 2521) no Hoare annotation was computed. [2021-11-13 18:05:23,202 INFO L854 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)) [2021-11-13 18:05:23,202 INFO L854 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)))) [2021-11-13 18:05:23,202 INFO L858 garLoopResultBuilder]: For program point L2783(lines 2783 2787) no Hoare annotation was computed. [2021-11-13 18:05:23,202 INFO L858 garLoopResultBuilder]: For program point L2684(lines 2684 2718) no Hoare annotation was computed. [2021-11-13 18:05:23,202 INFO L858 garLoopResultBuilder]: For program point L2750-1(line 2750) no Hoare annotation was computed. [2021-11-13 18:05:23,203 INFO L854 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)) [2021-11-13 18:05:23,203 INFO L858 garLoopResultBuilder]: For program point L2486-1(line 2486) no Hoare annotation was computed. [2021-11-13 18:05:23,203 INFO L854 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)) [2021-11-13 18:05:23,203 INFO L858 garLoopResultBuilder]: For program point L2883-1(line 2883) no Hoare annotation was computed. [2021-11-13 18:05:23,203 INFO L854 garLoopResultBuilder]: At program point L2883(line 2883) the Hoare annotation is: false [2021-11-13 18:05:23,204 INFO L854 garLoopResultBuilder]: At program point L2784(line 2784) the Hoare annotation is: false [2021-11-13 18:05:23,204 INFO L858 garLoopResultBuilder]: For program point L2784-1(line 2784) no Hoare annotation was computed. [2021-11-13 18:05:23,204 INFO L854 garLoopResultBuilder]: At program point L2884(lines 2880 2886) the Hoare annotation is: false [2021-11-13 18:05:23,204 INFO L858 garLoopResultBuilder]: For program point L2686(lines 2686 2715) no Hoare annotation was computed. [2021-11-13 18:05:23,204 INFO L858 garLoopResultBuilder]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2021-11-13 18:05:23,204 INFO L858 garLoopResultBuilder]: For program point L2488(lines 2488 2496) no Hoare annotation was computed. [2021-11-13 18:05:23,205 INFO L854 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)) [2021-11-13 18:05:23,205 INFO L854 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)) [2021-11-13 18:05:23,205 INFO L858 garLoopResultBuilder]: For program point L2720(line 2720) no Hoare annotation was computed. [2021-11-13 18:05:23,205 INFO L858 garLoopResultBuilder]: For program point L2687(line 2687) no Hoare annotation was computed. [2021-11-13 18:05:23,205 INFO L858 garLoopResultBuilder]: For program point L2489(lines 2489 2492) no Hoare annotation was computed. [2021-11-13 18:05:23,205 INFO L858 garLoopResultBuilder]: For program point L2489-2(lines 2489 2492) no Hoare annotation was computed. [2021-11-13 18:05:23,206 INFO L858 garLoopResultBuilder]: For program point L2688(lines 2688 2693) no Hoare annotation was computed. [2021-11-13 18:05:23,206 INFO L858 garLoopResultBuilder]: For program point L2721(lines 2721 2776) no Hoare annotation was computed. [2021-11-13 18:05:23,206 INFO L858 garLoopResultBuilder]: For program point L2655-1(line 2655) no Hoare annotation was computed. [2021-11-13 18:05:23,206 INFO L854 garLoopResultBuilder]: At program point L2655(line 2655) the Hoare annotation is: false [2021-11-13 18:05:23,206 INFO L854 garLoopResultBuilder]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2021-11-13 18:05:23,206 INFO L858 garLoopResultBuilder]: For program point L2821(line 2821) no Hoare annotation was computed. [2021-11-13 18:05:23,207 INFO L858 garLoopResultBuilder]: For program point L2755(line 2755) no Hoare annotation was computed. [2021-11-13 18:05:23,207 INFO L858 garLoopResultBuilder]: For program point L2689-1(line 2689) no Hoare annotation was computed. [2021-11-13 18:05:23,207 INFO L854 garLoopResultBuilder]: At program point L2689(line 2689) the Hoare annotation is: (and (= ~ldv_spin~0 0) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-13 18:05:23,207 INFO L858 garLoopResultBuilder]: For program point L2524-1(lines 2425 2585) no Hoare annotation was computed. [2021-11-13 18:05:23,207 INFO L854 garLoopResultBuilder]: At program point L3053(lines 3052 3054) the Hoare annotation is: false [2021-11-13 18:05:23,207 INFO L858 garLoopResultBuilder]: For program point L2822(lines 2822 2827) no Hoare annotation was computed. [2021-11-13 18:05:23,207 INFO L858 garLoopResultBuilder]: For program point L2756(lines 2756 2761) no Hoare annotation was computed. [2021-11-13 18:05:23,208 INFO L858 garLoopResultBuilder]: For program point L2789(line 2789) no Hoare annotation was computed. [2021-11-13 18:05:23,208 INFO L858 garLoopResultBuilder]: For program point L2723(lines 2723 2773) no Hoare annotation was computed. [2021-11-13 18:05:23,208 INFO L858 garLoopResultBuilder]: For program point L2624(lines 2624 2838) no Hoare annotation was computed. [2021-11-13 18:05:23,208 INFO L858 garLoopResultBuilder]: For program point L2558(lines 2558 2561) no Hoare annotation was computed. [2021-11-13 18:05:23,208 INFO L858 garLoopResultBuilder]: For program point L2790(lines 2790 2794) no Hoare annotation was computed. [2021-11-13 18:05:23,208 INFO L858 garLoopResultBuilder]: For program point L2724(line 2724) no Hoare annotation was computed. [2021-11-13 18:05:23,209 INFO L858 garLoopResultBuilder]: For program point L2790-2(lines 2781 2831) no Hoare annotation was computed. [2021-11-13 18:05:23,209 INFO L858 garLoopResultBuilder]: For program point L2625(line 2625) no Hoare annotation was computed. [2021-11-13 18:05:23,209 INFO L858 garLoopResultBuilder]: For program point L2526(lines 2526 2529) no Hoare annotation was computed. [2021-11-13 18:05:23,209 INFO L858 garLoopResultBuilder]: For program point L2791-1(line 2791) no Hoare annotation was computed. [2021-11-13 18:05:23,209 INFO L854 garLoopResultBuilder]: At program point L2791(line 2791) the Hoare annotation is: false [2021-11-13 18:05:23,209 INFO L858 garLoopResultBuilder]: For program point L2725(lines 2725 2729) no Hoare annotation was computed. [2021-11-13 18:05:23,210 INFO L858 garLoopResultBuilder]: For program point L2626(lines 2626 2681) no Hoare annotation was computed. [2021-11-13 18:05:23,210 INFO L854 garLoopResultBuilder]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2021-11-13 18:05:23,210 INFO L854 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)))) [2021-11-13 18:05:23,210 INFO L858 garLoopResultBuilder]: For program point L2660(line 2660) no Hoare annotation was computed. [2021-11-13 18:05:23,210 INFO L858 garLoopResultBuilder]: For program point L2726-1(line 2726) no Hoare annotation was computed. [2021-11-13 18:05:23,210 INFO L858 garLoopResultBuilder]: For program point L2628(lines 2628 2678) no Hoare annotation was computed. [2021-11-13 18:05:23,211 INFO L858 garLoopResultBuilder]: For program point L2661(lines 2661 2666) no Hoare annotation was computed. [2021-11-13 18:05:23,211 INFO L858 garLoopResultBuilder]: For program point L2695(line 2695) no Hoare annotation was computed. [2021-11-13 18:05:23,211 INFO L858 garLoopResultBuilder]: For program point L2629(line 2629) no Hoare annotation was computed. [2021-11-13 18:05:23,211 INFO L854 garLoopResultBuilder]: At program point L2563(lines 2425 2585) the Hoare annotation is: false [2021-11-13 18:05:23,211 INFO L854 garLoopResultBuilder]: At program point L2464(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-13 18:05:23,212 INFO L858 garLoopResultBuilder]: For program point L2431(lines 2431 2435) no Hoare annotation was computed. [2021-11-13 18:05:23,212 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,212 INFO L858 garLoopResultBuilder]: For program point L2431-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-13 18:05:23,212 INFO L858 garLoopResultBuilder]: For program point L2696(lines 2696 2711) no Hoare annotation was computed. [2021-11-13 18:05:23,212 INFO L858 garLoopResultBuilder]: For program point L2630(lines 2630 2634) no Hoare annotation was computed. [2021-11-13 18:05:23,212 INFO L854 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)))) [2021-11-13 18:05:23,213 INFO L854 garLoopResultBuilder]: At program point L2796(line 2796) the Hoare annotation is: false [2021-11-13 18:05:23,213 INFO L858 garLoopResultBuilder]: For program point L2829(line 2829) no Hoare annotation was computed. [2021-11-13 18:05:23,213 INFO L858 garLoopResultBuilder]: For program point L2763(line 2763) no Hoare annotation was computed. [2021-11-13 18:05:23,213 INFO L858 garLoopResultBuilder]: For program point L2796-1(line 2796) no Hoare annotation was computed. [2021-11-13 18:05:23,213 INFO L858 garLoopResultBuilder]: For program point L2631-1(line 2631) no Hoare annotation was computed. [2021-11-13 18:05:23,213 INFO L854 garLoopResultBuilder]: At program point L2631(line 2631) the Hoare annotation is: false [2021-11-13 18:05:23,214 INFO L854 garLoopResultBuilder]: At program point L2565(lines 2425 2585) the Hoare annotation is: false [2021-11-13 18:05:23,214 INFO L854 garLoopResultBuilder]: At program point L2466(lines 2456 2472) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-13 18:05:23,214 INFO L858 garLoopResultBuilder]: For program point L2532-1(lines 2532 2539) no Hoare annotation was computed. [2021-11-13 18:05:23,214 INFO L854 garLoopResultBuilder]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2021-11-13 18:05:23,214 INFO L861 garLoopResultBuilder]: At program point L2830(line 2830) the Hoare annotation is: true [2021-11-13 18:05:23,214 INFO L858 garLoopResultBuilder]: For program point L2764(lines 2764 2769) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2698(lines 2698 2704) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2731(line 2731) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2698-2(lines 2696 2710) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2732(lines 2732 2736) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2732-2(lines 2723 2773) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2534(lines 2534 2537) no Hoare annotation was computed. [2021-11-13 18:05:23,215 INFO L858 garLoopResultBuilder]: For program point L2733-1(line 2733) no Hoare annotation was computed. [2021-11-13 18:05:23,216 INFO L854 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)))) [2021-11-13 18:05:23,216 INFO L858 garLoopResultBuilder]: For program point L2568(lines 2568 2578) no Hoare annotation was computed. [2021-11-13 18:05:23,216 INFO L854 garLoopResultBuilder]: At program point L2568-2(lines 2568 2578) the Hoare annotation is: false [2021-11-13 18:05:23,216 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,216 INFO L854 garLoopResultBuilder]: At program point L2998(lines 2997 2999) the Hoare annotation is: false [2021-11-13 18:05:23,217 INFO L858 garLoopResultBuilder]: For program point L2668(line 2668) no Hoare annotation was computed. [2021-11-13 18:05:23,217 INFO L858 garLoopResultBuilder]: For program point L2569-1(lines 2569 2572) no Hoare annotation was computed. [2021-11-13 18:05:23,217 INFO L854 garLoopResultBuilder]: At program point L2569(lines 2569 2572) the Hoare annotation is: false [2021-11-13 18:05:23,217 INFO L854 garLoopResultBuilder]: At program point L2470(line 2470) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (<= (+ ~nwriters_stress~0 1) 0)) [2021-11-13 18:05:23,217 INFO L854 garLoopResultBuilder]: At program point L2503(lines 2425 2585) the Hoare annotation is: false [2021-11-13 18:05:23,217 INFO L858 garLoopResultBuilder]: For program point L2470-1(line 2470) no Hoare annotation was computed. [2021-11-13 18:05:23,217 INFO L858 garLoopResultBuilder]: For program point L2801(line 2801) no Hoare annotation was computed. [2021-11-13 18:05:23,218 INFO L858 garLoopResultBuilder]: For program point L2636(line 2636) no Hoare annotation was computed. [2021-11-13 18:05:23,218 INFO L858 garLoopResultBuilder]: For program point L2669(lines 2669 2674) no Hoare annotation was computed. [2021-11-13 18:05:23,218 INFO L858 garLoopResultBuilder]: For program point L2802(lines 2802 2806) no Hoare annotation was computed. [2021-11-13 18:05:23,218 INFO L858 garLoopResultBuilder]: For program point L2802-2(lines 2781 2831) no Hoare annotation was computed. [2021-11-13 18:05:23,218 INFO L858 garLoopResultBuilder]: For program point L2637(lines 2637 2641) no Hoare annotation was computed. [2021-11-13 18:05:23,218 INFO L858 garLoopResultBuilder]: For program point L2637-2(lines 2628 2678) no Hoare annotation was computed. [2021-11-13 18:05:23,219 INFO L854 garLoopResultBuilder]: At program point L2505(lines 2425 2585) the Hoare annotation is: false [2021-11-13 18:05:23,219 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,219 INFO L858 garLoopResultBuilder]: For program point L2836(line 2836) no Hoare annotation was computed. [2021-11-13 18:05:23,219 INFO L858 garLoopResultBuilder]: For program point L2803-1(line 2803) no Hoare annotation was computed. [2021-11-13 18:05:23,219 INFO L854 garLoopResultBuilder]: At program point L2803(line 2803) the Hoare annotation is: false [2021-11-13 18:05:23,219 INFO L854 garLoopResultBuilder]: At program point L2638(line 2638) the Hoare annotation is: false [2021-11-13 18:05:23,220 INFO L858 garLoopResultBuilder]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2021-11-13 18:05:23,220 INFO L854 garLoopResultBuilder]: At program point L3068(lines 3067 3069) the Hoare annotation is: false [2021-11-13 18:05:23,220 INFO L854 garLoopResultBuilder]: At program point L3002(lines 3001 3003) the Hoare annotation is: false [2021-11-13 18:05:23,220 INFO L854 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)) [2021-11-13 18:05:23,220 INFO L861 garLoopResultBuilder]: At program point L2837(line 2837) the Hoare annotation is: true [2021-11-13 18:05:23,220 INFO L854 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)))) [2021-11-13 18:05:23,221 INFO L858 garLoopResultBuilder]: For program point L2771(line 2771) no Hoare annotation was computed. [2021-11-13 18:05:23,221 INFO L858 garLoopResultBuilder]: For program point L2738-1(line 2738) no Hoare annotation was computed. [2021-11-13 18:05:23,221 INFO L858 garLoopResultBuilder]: For program point L2573(lines 2573 2576) no Hoare annotation was computed. [2021-11-13 18:05:23,221 INFO L858 garLoopResultBuilder]: For program point L2474(lines 2474 2477) no Hoare annotation was computed. [2021-11-13 18:05:23,221 INFO L858 garLoopResultBuilder]: For program point L2474-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-13 18:05:23,221 INFO L854 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)) [2021-11-13 18:05:23,222 INFO L861 garLoopResultBuilder]: At program point L2772(line 2772) the Hoare annotation is: true [2021-11-13 18:05:23,222 INFO L854 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)) [2021-11-13 18:05:23,222 INFO L858 garLoopResultBuilder]: For program point L2508(lines 2508 2515) no Hoare annotation was computed. [2021-11-13 18:05:23,222 INFO L858 garLoopResultBuilder]: For program point L2475-1(line 2475) no Hoare annotation was computed. [2021-11-13 18:05:23,222 INFO L858 garLoopResultBuilder]: For program point L2508-2(lines 2425 2585) no Hoare annotation was computed. [2021-11-13 18:05:23,222 INFO L854 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)) [2021-11-13 18:05:23,223 INFO L854 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)))) [2021-11-13 18:05:23,223 INFO L861 garLoopResultBuilder]: At program point L2707(lines 2609 2844) the Hoare annotation is: true [2021-11-13 18:05:23,223 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2550) no Hoare annotation was computed. [2021-11-13 18:05:23,223 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-13 18:05:23,223 INFO L858 garLoopResultBuilder]: For program point L2510(lines 2510 2513) no Hoare annotation was computed. [2021-11-13 18:05:23,223 INFO L858 garLoopResultBuilder]: For program point L2543(lines 2543 2546) no Hoare annotation was computed. [2021-11-13 18:05:23,224 INFO L858 garLoopResultBuilder]: For program point L2543-2(lines 2543 2546) no Hoare annotation was computed. [2021-11-13 18:05:23,224 INFO L854 garLoopResultBuilder]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2021-11-13 18:05:23,224 INFO L854 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)))) [2021-11-13 18:05:23,224 INFO L854 garLoopResultBuilder]: At program point L2808(line 2808) the Hoare annotation is: false [2021-11-13 18:05:23,224 INFO L858 garLoopResultBuilder]: For program point L2808-1(line 2808) no Hoare annotation was computed. [2021-11-13 18:05:23,224 INFO L858 garLoopResultBuilder]: For program point L2676(line 2676) no Hoare annotation was computed. [2021-11-13 18:05:23,225 INFO L854 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)) [2021-11-13 18:05:23,225 INFO L858 garLoopResultBuilder]: For program point L2643-1(line 2643) no Hoare annotation was computed. [2021-11-13 18:05:23,225 INFO L854 garLoopResultBuilder]: At program point L2643(line 2643) the Hoare annotation is: false [2021-11-13 18:05:23,225 INFO L858 garLoopResultBuilder]: For program point L2610-1(line 2610) no Hoare annotation was computed. [2021-11-13 18:05:23,225 INFO L858 garLoopResultBuilder]: For program point L2445(lines 2445 2448) no Hoare annotation was computed. [2021-11-13 18:05:23,225 INFO L854 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)) [2021-11-13 18:05:23,226 INFO L858 garLoopResultBuilder]: For program point L2743(line 2743) no Hoare annotation was computed. [2021-11-13 18:05:23,226 INFO L861 garLoopResultBuilder]: At program point L2677(line 2677) the Hoare annotation is: true [2021-11-13 18:05:23,226 INFO L854 garLoopResultBuilder]: At program point L2894(line 2894) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (<= (+ ~nwriters_stress~0 1) 0))) [2021-11-13 18:05:23,226 INFO L858 garLoopResultBuilder]: For program point ldv_check_alloc_flagsEXIT(lines 2889 2898) no Hoare annotation was computed. [2021-11-13 18:05:23,226 INFO L858 garLoopResultBuilder]: For program point L2892(lines 2892 2895) no Hoare annotation was computed. [2021-11-13 18:05:23,226 INFO L858 garLoopResultBuilder]: For program point L2894-1(lines 2889 2898) no Hoare annotation was computed. [2021-11-13 18:05:23,227 INFO L861 garLoopResultBuilder]: At program point ldv_check_alloc_flagsENTRY(lines 2889 2898) the Hoare annotation is: true [2021-11-13 18:05:23,230 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:05:23,232 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 18:05:23,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 06:05:23 BoogieIcfgContainer [2021-11-13 18:05:23,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 18:05:23,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 18:05:23,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 18:05:23,264 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 18:05:23,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:58:22" (3/4) ... [2021-11-13 18:05:23,267 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-13 18:05:23,274 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_stop_kthread [2021-11-13 18:05:23,274 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-11-13 18:05:23,274 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2021-11-13 18:05:23,274 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2021-11-13 18:05:23,274 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2021-11-13 18:05:23,274 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_random [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2021-11-13 18:05:23,275 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_init_end [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2021-11-13 18:05:23,276 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2021-11-13 18:05:23,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-11-13 18:05:23,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _torture_create_kthread [2021-11-13 18:05:23,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2021-11-13 18:05:23,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2021-11-13 18:05:23,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2021-11-13 18:05:23,277 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2021-11-13 18:05:23,278 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2021-11-13 18:05:23,316 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 126 nodes and edges [2021-11-13 18:05:23,319 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2021-11-13 18:05:23,321 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-13 18:05:23,323 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-13 18:05:23,325 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-13 18:05:23,327 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-13 18:05:23,329 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-13 18:05:23,373 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) [2021-11-13 18:05:23,373 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)) [2021-11-13 18:05:23,374 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)) [2021-11-13 18:05:23,375 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)) [2021-11-13 18:05:23,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/witness.graphml [2021-11-13 18:05:23,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 18:05:23,497 INFO L158 Benchmark]: Toolchain (without parser) took 425618.07ms. Allocated memory was 100.7MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 65.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 502.0MB. Max. memory is 16.1GB. [2021-11-13 18:05:23,497 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 79.7MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 18:05:23,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1421.74ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 47.7MB in the end (delta: 17.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2021-11-13 18:05:23,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.60ms. Allocated memory is still 100.7MB. Free memory was 47.7MB in the beginning and 41.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-13 18:05:23,499 INFO L158 Benchmark]: Boogie Preprocessor took 136.92ms. Allocated memory is still 100.7MB. Free memory was 41.9MB in the beginning and 36.3MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-13 18:05:23,500 INFO L158 Benchmark]: RCFGBuilder took 2943.92ms. Allocated memory was 100.7MB in the beginning and 155.2MB in the end (delta: 54.5MB). Free memory was 36.3MB in the beginning and 112.7MB in the end (delta: -76.4MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2021-11-13 18:05:23,500 INFO L158 Benchmark]: TraceAbstraction took 420688.09ms. Allocated memory was 155.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 112.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2021-11-13 18:05:23,510 INFO L158 Benchmark]: Witness Printer took 233.17ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-11-13 18:05:23,512 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.36ms. Allocated memory is still 79.7MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1421.74ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 47.7MB in the end (delta: 17.5MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.60ms. Allocated memory is still 100.7MB. Free memory was 47.7MB in the beginning and 41.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.92ms. Allocated memory is still 100.7MB. Free memory was 41.9MB in the beginning and 36.3MB in the end (delta: 5.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2943.92ms. Allocated memory was 100.7MB in the beginning and 155.2MB in the end (delta: 54.5MB). Free memory was 36.3MB in the beginning and 112.7MB in the end (delta: -76.4MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 420688.09ms. Allocated memory was 155.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 112.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 233.17ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. 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: 420.6s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 64.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 342.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 10702 SdHoareTripleChecker+Valid, 57570.80ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10281 mSDsluCounter, 20148 SdHoareTripleChecker+Invalid, 51130.93ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12067 mSDsCounter, 4409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6575 IncrementalHoareTripleChecker+Invalid, 10986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4409 mSolverCounterUnsat, 8081 mSDtfsCounter, 6575 mSolverCounterSat, 247.72ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.8s 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: 5.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 7240 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 139 LocationsWithAnnotation, 21749 PreInvPairs, 23013 NumberOfFragments, 1944 HoareAnnotationTreeSize, 21749 FomulaSimplifications, 8815990 FormulaSimplificationTreeSizeReduction, 333.7s HoareSimplificationTime, 139 FomulaSimplificationsInter, 1904441 FormulaSimplificationTreeSizeReductionInter, 8.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1696 NumberOfCodeBlocks, 1696 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1679 ConstructedInterpolants, 0 QuantifiedInterpolants, 3201 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2210 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! [2021-11-13 18:05:23,770 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-13 18:05:23,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c86fe8-ee28-4d45-b082-6d4f8c1c4312/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE