./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/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-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash daceda4fb3bf12a25eb56ddc650ae304c7e70427 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:45,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:45,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:45,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:45,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:45,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:45,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:45,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:45,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:45,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:45,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:45,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:45,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:45,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:45,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:45,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:45,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:45,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:45,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:45,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:45,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:45,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:45,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:45,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:45,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:45,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:45,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:45,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:45,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:45,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:45,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:45,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:45,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:45,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:45,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:45,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:45,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:45,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:45,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:45,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:45,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:45,672 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-10-22 08:57:45,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:45,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:45,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:45,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:45,683 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:45,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:45,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:45,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:45,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:45,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:45,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:45,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:45,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:45,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:45,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:45,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:45,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:45,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:45,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:45,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:45,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:45,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:45,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:45,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:45,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:45,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:57:45,687 INFO L138 SettingsManager]: * To the following directory=dump/ 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-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer 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(__VERIFIER_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 -> daceda4fb3bf12a25eb56ddc650ae304c7e70427 [2019-10-22 08:57:45,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:45,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:45,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:45,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:45,723 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:45,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/../../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 [2019-10-22 08:57:45,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/data/51b1b8b27/5d4eba6d17524e4aa96b0b36ea40a04f/FLAG96908c306 [2019-10-22 08:57:46,276 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:46,277 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/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 [2019-10-22 08:57:46,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/data/51b1b8b27/5d4eba6d17524e4aa96b0b36ea40a04f/FLAG96908c306 [2019-10-22 08:57:46,539 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/data/51b1b8b27/5d4eba6d17524e4aa96b0b36ea40a04f [2019-10-22 08:57:46,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:46,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:46,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:46,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:46,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:46,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:46" (1/1) ... [2019-10-22 08:57:46,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71abecf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:46, skipping insertion in model container [2019-10-22 08:57:46,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:46" (1/1) ... [2019-10-22 08:57:46,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:46,638 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:47,005 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-10-22 08:57:47,005 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-10-22 08:57:47,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:47,364 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:47,420 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-10-22 08:57:47,421 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-10-22 08:57:47,505 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:47,567 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:47,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47 WrapperNode [2019-10-22 08:57:47,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:47,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:47,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:47,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:47,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:47,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:47,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:47,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:47,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... [2019-10-22 08:57:47,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:47,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:47,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:47,764 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:47,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:47,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:47,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:57:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:57:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:47,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:57:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:57:47,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 08:57:47,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:47,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:50,005 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:50,006 INFO L284 CfgBuilder]: Removed 344 assume(true) statements. [2019-10-22 08:57:50,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:50 BoogieIcfgContainer [2019-10-22 08:57:50,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:50,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:50,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:50,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:50,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:46" (1/3) ... [2019-10-22 08:57:50,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f775537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:50, skipping insertion in model container [2019-10-22 08:57:50,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:47" (2/3) ... [2019-10-22 08:57:50,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f775537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:50, skipping insertion in model container [2019-10-22 08:57:50,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:50" (3/3) ... [2019-10-22 08:57:50,014 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-10-22 08:57:50,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:50,032 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-22 08:57:50,041 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-22 08:57:50,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:50,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:50,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:50,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:50,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:50,064 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:50,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:50,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-10-22 08:57:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:57:50,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:50,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:50,097 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -608431788, now seen corresponding path program 1 times [2019-10-22 08:57:50,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:50,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598733443] [2019-10-22 08:57:50,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:50,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:50,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:50,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598733443] [2019-10-22 08:57:50,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:50,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:50,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093234437] [2019-10-22 08:57:50,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:50,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:50,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:50,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:50,503 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-10-22 08:57:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:50,770 INFO L93 Difference]: Finished difference Result 797 states and 1162 transitions. [2019-10-22 08:57:50,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:50,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 08:57:50,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:50,790 INFO L225 Difference]: With dead ends: 797 [2019-10-22 08:57:50,791 INFO L226 Difference]: Without dead ends: 433 [2019-10-22 08:57:50,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-22 08:57:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-10-22 08:57:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-22 08:57:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 620 transitions. [2019-10-22 08:57:50,877 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 620 transitions. Word has length 22 [2019-10-22 08:57:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:50,877 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 620 transitions. [2019-10-22 08:57:50,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 620 transitions. [2019-10-22 08:57:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:57:50,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:50,879 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:50,879 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 164474749, now seen corresponding path program 1 times [2019-10-22 08:57:50,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:50,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716213843] [2019-10-22 08:57:50,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:50,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:50,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:51,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716213843] [2019-10-22 08:57:51,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:51,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:51,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295272949] [2019-10-22 08:57:51,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:51,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:51,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:51,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,035 INFO L87 Difference]: Start difference. First operand 433 states and 620 transitions. Second operand 3 states. [2019-10-22 08:57:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:51,063 INFO L93 Difference]: Finished difference Result 854 states and 1225 transitions. [2019-10-22 08:57:51,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:51,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 08:57:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:51,066 INFO L225 Difference]: With dead ends: 854 [2019-10-22 08:57:51,066 INFO L226 Difference]: Without dead ends: 433 [2019-10-22 08:57:51,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-22 08:57:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-10-22 08:57:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-10-22 08:57:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-10-22 08:57:51,102 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 27 [2019-10-22 08:57:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:51,102 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-10-22 08:57:51,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-10-22 08:57:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:57:51,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:51,104 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,105 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:51,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash -915481931, now seen corresponding path program 1 times [2019-10-22 08:57:51,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106943950] [2019-10-22 08:57:51,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:51,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106943950] [2019-10-22 08:57:51,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:51,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:51,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003391436] [2019-10-22 08:57:51,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:51,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,193 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-10-22 08:57:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:51,253 INFO L93 Difference]: Finished difference Result 821 states and 1190 transitions. [2019-10-22 08:57:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:51,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 08:57:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:51,257 INFO L225 Difference]: With dead ends: 821 [2019-10-22 08:57:51,257 INFO L226 Difference]: Without dead ends: 801 [2019-10-22 08:57:51,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-22 08:57:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2019-10-22 08:57:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-10-22 08:57:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1168 transitions. [2019-10-22 08:57:51,295 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1168 transitions. Word has length 30 [2019-10-22 08:57:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:51,296 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1168 transitions. [2019-10-22 08:57:51,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1168 transitions. [2019-10-22 08:57:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:57:51,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:51,298 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1741341408, now seen corresponding path program 1 times [2019-10-22 08:57:51,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190826550] [2019-10-22 08:57:51,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:51,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190826550] [2019-10-22 08:57:51,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:51,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:51,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947537967] [2019-10-22 08:57:51,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:51,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,352 INFO L87 Difference]: Start difference. First operand 801 states and 1168 transitions. Second operand 3 states. [2019-10-22 08:57:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:51,449 INFO L93 Difference]: Finished difference Result 2225 states and 3248 transitions. [2019-10-22 08:57:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:51,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-22 08:57:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:51,454 INFO L225 Difference]: With dead ends: 2225 [2019-10-22 08:57:51,454 INFO L226 Difference]: Without dead ends: 1436 [2019-10-22 08:57:51,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-10-22 08:57:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1416. [2019-10-22 08:57:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-10-22 08:57:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2074 transitions. [2019-10-22 08:57:51,498 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2074 transitions. Word has length 37 [2019-10-22 08:57:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:51,498 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2074 transitions. [2019-10-22 08:57:51,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2074 transitions. [2019-10-22 08:57:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:57:51,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:51,500 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:57:51,500 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:51,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash -548172063, now seen corresponding path program 1 times [2019-10-22 08:57:51,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657607885] [2019-10-22 08:57:51,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:51,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657607885] [2019-10-22 08:57:51,568 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:51,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:51,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181712015] [2019-10-22 08:57:51,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:51,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,570 INFO L87 Difference]: Start difference. First operand 1416 states and 2074 transitions. Second operand 3 states. [2019-10-22 08:57:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:51,755 INFO L93 Difference]: Finished difference Result 3922 states and 5746 transitions. [2019-10-22 08:57:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:51,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 08:57:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:51,763 INFO L225 Difference]: With dead ends: 3922 [2019-10-22 08:57:51,763 INFO L226 Difference]: Without dead ends: 2518 [2019-10-22 08:57:51,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-10-22 08:57:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2498. [2019-10-22 08:57:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-10-22 08:57:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3662 transitions. [2019-10-22 08:57:51,842 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3662 transitions. Word has length 41 [2019-10-22 08:57:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:51,842 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3662 transitions. [2019-10-22 08:57:51,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3662 transitions. [2019-10-22 08:57:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 08:57:51,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:51,845 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:51,845 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1040933221, now seen corresponding path program 1 times [2019-10-22 08:57:51,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:51,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942413787] [2019-10-22 08:57:51,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:51,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:57:51,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942413787] [2019-10-22 08:57:51,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:51,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:51,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647721437] [2019-10-22 08:57:51,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:51,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:51,904 INFO L87 Difference]: Start difference. First operand 2498 states and 3662 transitions. Second operand 3 states. [2019-10-22 08:57:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:52,012 INFO L93 Difference]: Finished difference Result 6402 states and 9436 transitions. [2019-10-22 08:57:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:52,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-22 08:57:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:52,027 INFO L225 Difference]: With dead ends: 6402 [2019-10-22 08:57:52,027 INFO L226 Difference]: Without dead ends: 3916 [2019-10-22 08:57:52,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2019-10-22 08:57:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 2506. [2019-10-22 08:57:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-10-22 08:57:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3670 transitions. [2019-10-22 08:57:52,141 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3670 transitions. Word has length 42 [2019-10-22 08:57:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:52,142 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 3670 transitions. [2019-10-22 08:57:52,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3670 transitions. [2019-10-22 08:57:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 08:57:52,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:52,144 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:52,144 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1181481831, now seen corresponding path program 1 times [2019-10-22 08:57:52,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214963493] [2019-10-22 08:57:52,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:57:52,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214963493] [2019-10-22 08:57:52,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:52,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:52,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328286228] [2019-10-22 08:57:52,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:52,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:52,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:52,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:52,228 INFO L87 Difference]: Start difference. First operand 2506 states and 3670 transitions. Second operand 4 states. [2019-10-22 08:57:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:52,494 INFO L93 Difference]: Finished difference Result 5024 states and 7357 transitions. [2019-10-22 08:57:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:52,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-22 08:57:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:52,501 INFO L225 Difference]: With dead ends: 5024 [2019-10-22 08:57:52,501 INFO L226 Difference]: Without dead ends: 2482 [2019-10-22 08:57:52,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:52,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2019-10-22 08:57:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2474. [2019-10-22 08:57:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-10-22 08:57:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3614 transitions. [2019-10-22 08:57:52,587 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3614 transitions. Word has length 42 [2019-10-22 08:57:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:52,587 INFO L462 AbstractCegarLoop]: Abstraction has 2474 states and 3614 transitions. [2019-10-22 08:57:52,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3614 transitions. [2019-10-22 08:57:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:52,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:52,589 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:52,590 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:52,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash -645054872, now seen corresponding path program 1 times [2019-10-22 08:57:52,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025042316] [2019-10-22 08:57:52,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:52,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025042316] [2019-10-22 08:57:52,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:52,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:52,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858034042] [2019-10-22 08:57:52,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:52,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:52,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:52,698 INFO L87 Difference]: Start difference. First operand 2474 states and 3614 transitions. Second operand 3 states. [2019-10-22 08:57:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:53,033 INFO L93 Difference]: Finished difference Result 6132 states and 9000 transitions. [2019-10-22 08:57:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:53,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 08:57:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:53,044 INFO L225 Difference]: With dead ends: 6132 [2019-10-22 08:57:53,044 INFO L226 Difference]: Without dead ends: 3670 [2019-10-22 08:57:53,047 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-10-22 08:57:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3646. [2019-10-22 08:57:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2019-10-22 08:57:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5320 transitions. [2019-10-22 08:57:53,153 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 5320 transitions. Word has length 65 [2019-10-22 08:57:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:53,155 INFO L462 AbstractCegarLoop]: Abstraction has 3646 states and 5320 transitions. [2019-10-22 08:57:53,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 5320 transitions. [2019-10-22 08:57:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 08:57:53,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:53,157 INFO L380 BasicCegarLoop]: trace histogram [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, 1] [2019-10-22 08:57:53,157 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,157 INFO L82 PathProgramCache]: Analyzing trace with hash 108258473, now seen corresponding path program 1 times [2019-10-22 08:57:53,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967722487] [2019-10-22 08:57:53,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:53,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967722487] [2019-10-22 08:57:53,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:53,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:53,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8832937] [2019-10-22 08:57:53,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:53,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:53,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:53,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:53,258 INFO L87 Difference]: Start difference. First operand 3646 states and 5320 transitions. Second operand 3 states. [2019-10-22 08:57:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:53,580 INFO L93 Difference]: Finished difference Result 9043 states and 13258 transitions. [2019-10-22 08:57:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:53,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-22 08:57:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:53,596 INFO L225 Difference]: With dead ends: 9043 [2019-10-22 08:57:53,596 INFO L226 Difference]: Without dead ends: 5409 [2019-10-22 08:57:53,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-10-22 08:57:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5383. [2019-10-22 08:57:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5383 states. [2019-10-22 08:57:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 7840 transitions. [2019-10-22 08:57:53,749 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 7840 transitions. Word has length 69 [2019-10-22 08:57:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:53,749 INFO L462 AbstractCegarLoop]: Abstraction has 5383 states and 7840 transitions. [2019-10-22 08:57:53,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 7840 transitions. [2019-10-22 08:57:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 08:57:53,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:53,751 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-22 08:57:53,751 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1297310612, now seen corresponding path program 1 times [2019-10-22 08:57:53,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:53,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681850901] [2019-10-22 08:57:53,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 08:57:53,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681850901] [2019-10-22 08:57:53,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:53,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:53,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213262] [2019-10-22 08:57:53,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:53,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:53,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:53,860 INFO L87 Difference]: Start difference. First operand 5383 states and 7840 transitions. Second operand 5 states. [2019-10-22 08:57:54,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:54,290 INFO L93 Difference]: Finished difference Result 11476 states and 16665 transitions. [2019-10-22 08:57:54,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:54,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-22 08:57:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:54,311 INFO L225 Difference]: With dead ends: 11476 [2019-10-22 08:57:54,311 INFO L226 Difference]: Without dead ends: 5448 [2019-10-22 08:57:54,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:54,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2019-10-22 08:57:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 5326. [2019-10-22 08:57:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-10-22 08:57:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 7733 transitions. [2019-10-22 08:57:54,471 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 7733 transitions. Word has length 75 [2019-10-22 08:57:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:54,472 INFO L462 AbstractCegarLoop]: Abstraction has 5326 states and 7733 transitions. [2019-10-22 08:57:54,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 7733 transitions. [2019-10-22 08:57:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 08:57:54,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:54,475 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-22 08:57:54,475 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1590700609, now seen corresponding path program 1 times [2019-10-22 08:57:54,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326505042] [2019-10-22 08:57:54,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 08:57:54,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326505042] [2019-10-22 08:57:54,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:54,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:54,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504896938] [2019-10-22 08:57:54,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:54,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:54,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:54,568 INFO L87 Difference]: Start difference. First operand 5326 states and 7733 transitions. Second operand 3 states. [2019-10-22 08:57:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:54,688 INFO L93 Difference]: Finished difference Result 10604 states and 15397 transitions. [2019-10-22 08:57:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-22 08:57:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:54,708 INFO L225 Difference]: With dead ends: 10604 [2019-10-22 08:57:54,708 INFO L226 Difference]: Without dead ends: 5290 [2019-10-22 08:57:54,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2019-10-22 08:57:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 5290. [2019-10-22 08:57:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2019-10-22 08:57:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7661 transitions. [2019-10-22 08:57:54,852 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7661 transitions. Word has length 77 [2019-10-22 08:57:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:54,853 INFO L462 AbstractCegarLoop]: Abstraction has 5290 states and 7661 transitions. [2019-10-22 08:57:54,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7661 transitions. [2019-10-22 08:57:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 08:57:54,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:54,860 INFO L380 BasicCegarLoop]: trace histogram [4, 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] [2019-10-22 08:57:54,861 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1130087027, now seen corresponding path program 1 times [2019-10-22 08:57:54,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095696993] [2019-10-22 08:57:54,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 08:57:54,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095696993] [2019-10-22 08:57:54,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:54,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:54,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256292550] [2019-10-22 08:57:54,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:54,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:54,961 INFO L87 Difference]: Start difference. First operand 5290 states and 7661 transitions. Second operand 4 states. [2019-10-22 08:57:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:55,052 INFO L93 Difference]: Finished difference Result 5409 states and 7825 transitions. [2019-10-22 08:57:55,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:55,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 08:57:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:55,054 INFO L225 Difference]: With dead ends: 5409 [2019-10-22 08:57:55,054 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:55,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:55,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:55,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-10-22 08:57:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:55,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:55,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:55,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:56,363 INFO L446 ceAbstractionStarter]: At program point L1885(lines 1882 1887) the Hoare annotation is: true [2019-10-22 08:57:56,363 INFO L439 ceAbstractionStarter]: At program point L1885-1(lines 1882 1887) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,363 INFO L439 ceAbstractionStarter]: At program point L1885-2(lines 1882 1887) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,363 INFO L443 ceAbstractionStarter]: For program point L2810(lines 2810 2815) no Hoare annotation was computed. [2019-10-22 08:57:56,363 INFO L439 ceAbstractionStarter]: At program point L3009(lines 3008 3010) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,363 INFO L443 ceAbstractionStarter]: For program point L2679(line 2679) no Hoare annotation was computed. [2019-10-22 08:57:56,363 INFO L443 ceAbstractionStarter]: For program point L2283(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 08:57:56,363 INFO L443 ceAbstractionStarter]: For program point L2283-3(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L2283-2(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L2283-5(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L439 ceAbstractionStarter]: At program point L3076(lines 3075 3077) the Hoare annotation is: false [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L2283-6(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L2283-8(lines 2283 2286) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L2680(lines 2680 2714) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L1954(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L1954-1(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L1954-2(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 08:57:56,364 INFO L443 ceAbstractionStarter]: For program point L1954-3(lines 1954 1961) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L439 ceAbstractionStarter]: At program point L2153-1(lines 2126 2159) the Hoare annotation is: false [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2153(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L439 ceAbstractionStarter]: At program point L2153-3(lines 2126 2159) the Hoare annotation is: false [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2153-2(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L439 ceAbstractionStarter]: At program point L2153-5(lines 2126 2159) the Hoare annotation is: false [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2153-4(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L439 ceAbstractionStarter]: At program point L2153-7(lines 2126 2159) the Hoare annotation is: false [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2153-6(lines 2153 2156) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2682(lines 2682 2711) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2484(lines 2484 2492) no Hoare annotation was computed. [2019-10-22 08:57:56,365 INFO L443 ceAbstractionStarter]: For program point L2683(line 2683) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2485(lines 2485 2488) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2485-2(lines 2485 2488) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2287(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2287-3(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2287-2(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2287-5(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2287-6(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2287-8(lines 2287 2290) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2684(lines 2684 2689) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2817(line 2817) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2751(line 2751) no Hoare annotation was computed. [2019-10-22 08:57:56,366 INFO L443 ceAbstractionStarter]: For program point L2818(lines 2818 2823) no Hoare annotation was computed. [2019-10-22 08:57:56,367 INFO L443 ceAbstractionStarter]: For program point L2752(lines 2752 2757) no Hoare annotation was computed. [2019-10-22 08:57:56,367 INFO L443 ceAbstractionStarter]: For program point L2620(lines 2620 2834) no Hoare annotation was computed. [2019-10-22 08:57:56,367 INFO L443 ceAbstractionStarter]: For program point L2554(lines 2554 2557) no Hoare annotation was computed. [2019-10-22 08:57:56,367 INFO L443 ceAbstractionStarter]: For program point L2092(lines 2092 2105) no Hoare annotation was computed. [2019-10-22 08:57:56,367 INFO L439 ceAbstractionStarter]: At program point L2092-2(lines 2083 2108) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,367 INFO L446 ceAbstractionStarter]: At program point L1960(lines 1947 1963) the Hoare annotation is: true [2019-10-22 08:57:56,367 INFO L443 ceAbstractionStarter]: For program point L2092-3(lines 2092 2105) no Hoare annotation was computed. [2019-10-22 08:57:56,367 INFO L439 ceAbstractionStarter]: At program point L1960-1(lines 1947 1963) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,367 INFO L439 ceAbstractionStarter]: At program point L1960-2(lines 1947 1963) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,368 INFO L439 ceAbstractionStarter]: At program point L2092-5(lines 2083 2108) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,368 INFO L439 ceAbstractionStarter]: At program point L1960-3(lines 1947 1963) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,368 INFO L443 ceAbstractionStarter]: For program point L2621(line 2621) no Hoare annotation was computed. [2019-10-22 08:57:56,369 INFO L439 ceAbstractionStarter]: At program point L2886(lines 2882 2888) the Hoare annotation is: false [2019-10-22 08:57:56,369 INFO L443 ceAbstractionStarter]: For program point L2622(lines 2622 2677) no Hoare annotation was computed. [2019-10-22 08:57:56,369 INFO L446 ceAbstractionStarter]: At program point L2292(lines 2270 2308) the Hoare annotation is: true [2019-10-22 08:57:56,369 INFO L439 ceAbstractionStarter]: At program point L2292-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,369 INFO L439 ceAbstractionStarter]: At program point L2292-1(lines 2270 2308) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,370 INFO L439 ceAbstractionStarter]: At program point L2953(lines 2952 2954) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,370 INFO L443 ceAbstractionStarter]: For program point L3086(lines 3086 3088) no Hoare annotation was computed. [2019-10-22 08:57:56,370 INFO L443 ceAbstractionStarter]: For program point L3086-2(lines 3086 3088) no Hoare annotation was computed. [2019-10-22 08:57:56,370 INFO L446 ceAbstractionStarter]: At program point L3086-1(lines 1 3088) the Hoare annotation is: true [2019-10-22 08:57:56,370 INFO L443 ceAbstractionStarter]: For program point L3086-4(lines 3086 3088) no Hoare annotation was computed. [2019-10-22 08:57:56,370 INFO L439 ceAbstractionStarter]: At program point L3086-3(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,370 INFO L439 ceAbstractionStarter]: At program point L3086-5(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,370 INFO L443 ceAbstractionStarter]: For program point L2624(lines 2624 2674) no Hoare annotation was computed. [2019-10-22 08:57:56,370 INFO L446 ceAbstractionStarter]: At program point L2294(lines 2270 2308) the Hoare annotation is: true [2019-10-22 08:57:56,370 INFO L439 ceAbstractionStarter]: At program point L2294-2(lines 2270 2308) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,371 INFO L439 ceAbstractionStarter]: At program point L2294-1(lines 2270 2308) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,371 INFO L443 ceAbstractionStarter]: For program point L2691(line 2691) no Hoare annotation was computed. [2019-10-22 08:57:56,371 INFO L443 ceAbstractionStarter]: For program point L2625(line 2625) no Hoare annotation was computed. [2019-10-22 08:57:56,371 INFO L439 ceAbstractionStarter]: At program point L2559(lines 2421 2581) the Hoare annotation is: false [2019-10-22 08:57:56,371 INFO L443 ceAbstractionStarter]: For program point L2427(lines 2427 2431) no Hoare annotation was computed. [2019-10-22 08:57:56,372 INFO L443 ceAbstractionStarter]: For program point L2427-2(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 08:57:56,372 INFO L439 ceAbstractionStarter]: At program point L2956(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,372 INFO L439 ceAbstractionStarter]: At program point L2956-2(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,372 INFO L439 ceAbstractionStarter]: At program point L2956-1(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,372 INFO L439 ceAbstractionStarter]: At program point L2956-4(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,372 INFO L439 ceAbstractionStarter]: At program point L2956-3(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,372 INFO L439 ceAbstractionStarter]: At program point L2956-5(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2692(lines 2692 2707) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 2630) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2825(line 2825) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2759(line 2759) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L439 ceAbstractionStarter]: At program point L2561(lines 2421 2581) the Hoare annotation is: false [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2760(lines 2760 2765) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 2700) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L443 ceAbstractionStarter]: For program point L2694-2(lines 2692 2706) no Hoare annotation was computed. [2019-10-22 08:57:56,373 INFO L446 ceAbstractionStarter]: At program point L2364-2(lines 1 3088) the Hoare annotation is: true [2019-10-22 08:57:56,373 INFO L439 ceAbstractionStarter]: At program point L2364-6(lines 2357 2366) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2100(lines 2100 2103) no Hoare annotation was computed. [2019-10-22 08:57:56,374 INFO L439 ceAbstractionStarter]: At program point L2364-9(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2100-1(lines 2100 2103) no Hoare annotation was computed. [2019-10-22 08:57:56,374 INFO L439 ceAbstractionStarter]: At program point L2101-1(lines 2092 2104) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,374 INFO L439 ceAbstractionStarter]: At program point L2101(lines 2092 2104) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2894(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2894-2(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2894-4(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2894-6(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 08:57:56,374 INFO L443 ceAbstractionStarter]: For program point L2894-8(lines 2894 2897) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2564(lines 2564 2574) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L439 ceAbstractionStarter]: At program point L2564-2(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2300(line 2300) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2300-2(lines 2299 2301) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2300-3(line 2300) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2300-6(line 2300) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2300-5(lines 2299 2301) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2300-8(lines 2299 2301) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L439 ceAbstractionStarter]: At program point L2499(lines 2421 2581) the Hoare annotation is: false [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2301-1(line 2301) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2301-3(line 2301) no Hoare annotation was computed. [2019-10-22 08:57:56,375 INFO L443 ceAbstractionStarter]: For program point L2301-5(line 2301) no Hoare annotation was computed. [2019-10-22 08:57:56,376 INFO L443 ceAbstractionStarter]: For program point L1971(lines 1971 1978) no Hoare annotation was computed. [2019-10-22 08:57:56,376 INFO L439 ceAbstractionStarter]: At program point L2962(lines 2842 2849) the Hoare annotation is: false [2019-10-22 08:57:56,376 INFO L443 ceAbstractionStarter]: For program point L1971-1(lines 1971 1978) no Hoare annotation was computed. [2019-10-22 08:57:56,376 INFO L443 ceAbstractionStarter]: For program point L1971-2(lines 1971 1978) no Hoare annotation was computed. [2019-10-22 08:57:56,377 INFO L443 ceAbstractionStarter]: For program point L2632(line 2632) no Hoare annotation was computed. [2019-10-22 08:57:56,377 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 08:57:56,377 INFO L443 ceAbstractionStarter]: For program point L2633(lines 2633 2637) no Hoare annotation was computed. [2019-10-22 08:57:56,377 INFO L443 ceAbstractionStarter]: For program point L2633-2(lines 2624 2674) no Hoare annotation was computed. [2019-10-22 08:57:56,377 INFO L439 ceAbstractionStarter]: At program point L2501(lines 2421 2581) the Hoare annotation is: false [2019-10-22 08:57:56,377 INFO L446 ceAbstractionStarter]: At program point L2303-1(lines 2261 2309) the Hoare annotation is: true [2019-10-22 08:57:56,377 INFO L443 ceAbstractionStarter]: For program point L2303(lines 2303 2306) no Hoare annotation was computed. [2019-10-22 08:57:56,377 INFO L439 ceAbstractionStarter]: At program point L2303-3(lines 2261 2309) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,377 INFO L443 ceAbstractionStarter]: For program point L2303-2(lines 2303 2306) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L439 ceAbstractionStarter]: At program point L2303-5(lines 2261 2309) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point L2303-4(lines 2303 2306) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point L2832(line 2832) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L439 ceAbstractionStarter]: At program point L2965-1(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,378 INFO L439 ceAbstractionStarter]: At program point L2965-2(lines 1 3088) the Hoare annotation is: false [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point L2767(line 2767) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point L2569(lines 2569 2572) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L439 ceAbstractionStarter]: At program point L2570(lines 1 3088) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point L2504(lines 2504 2511) no Hoare annotation was computed. [2019-10-22 08:57:56,378 INFO L443 ceAbstractionStarter]: For program point L2504-2(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L2835(lines 2605 2840) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,379 INFO L446 ceAbstractionStarter]: At program point L2703(lines 1 3088) the Hoare annotation is: true [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L2175(lines 2169 2177) the Hoare annotation is: false [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L1977(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L2968(lines 2858 2865) the Hoare annotation is: false [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L1977-1(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L1977-2(lines 1964 1980) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L2968-2(lines 2858 2865) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,379 INFO L439 ceAbstractionStarter]: At program point L2968-1(lines 2858 2865) the Hoare annotation is: false [2019-10-22 08:57:56,380 INFO L443 ceAbstractionStarter]: For program point L2506(lines 2506 2509) no Hoare annotation was computed. [2019-10-22 08:57:56,380 INFO L439 ceAbstractionStarter]: At program point L3035-1(lines 3034 3036) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,380 INFO L439 ceAbstractionStarter]: At program point L3035(lines 3034 3036) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,381 INFO L439 ceAbstractionStarter]: At program point L3035-2(lines 3034 3036) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,381 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 2444) no Hoare annotation was computed. [2019-10-22 08:57:56,381 INFO L443 ceAbstractionStarter]: For program point L2375-1(lines 2375 2378) no Hoare annotation was computed. [2019-10-22 08:57:56,381 INFO L443 ceAbstractionStarter]: For program point L2375(lines 2375 2378) no Hoare annotation was computed. [2019-10-22 08:57:56,381 INFO L443 ceAbstractionStarter]: For program point L2375-2(lines 2375 2378) no Hoare annotation was computed. [2019-10-22 08:57:56,381 INFO L439 ceAbstractionStarter]: At program point L2112(lines 1 3088) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,381 INFO L439 ceAbstractionStarter]: At program point L2112-2(lines 2109 2114) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,381 INFO L439 ceAbstractionStarter]: At program point L2112-1(lines 2109 2114) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,381 INFO L446 ceAbstractionStarter]: At program point L2839(lines 2592 2841) the Hoare annotation is: true [2019-10-22 08:57:56,381 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L439 ceAbstractionStarter]: At program point L2972(lines 2971 2973) the Hoare annotation is: false [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L439 ceAbstractionStarter]: At program point L2972-1(lines 2971 2973) the Hoare annotation is: false [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L2774(line 2774) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L439 ceAbstractionStarter]: At program point L3039(lines 3038 3040) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L2775(lines 2775 2830) no Hoare annotation was computed. [2019-10-22 08:57:56,382 INFO L443 ceAbstractionStarter]: For program point L2709(line 2709) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2379(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2379-3(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2379-2(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2379-5(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2379-6(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2379-8(lines 2379 2393) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2644(line 2644) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L439 ceAbstractionStarter]: At program point L2446(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,383 INFO L443 ceAbstractionStarter]: For program point L2512-1(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 08:57:56,383 INFO L439 ceAbstractionStarter]: At program point L2182(lines 2178 2184) the Hoare annotation is: false [2019-10-22 08:57:56,383 INFO L439 ceAbstractionStarter]: At program point L2182-1(lines 2178 2184) the Hoare annotation is: false [2019-10-22 08:57:56,384 INFO L439 ceAbstractionStarter]: At program point L2975-1(lines 2974 2976) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,384 INFO L439 ceAbstractionStarter]: At program point L2975(lines 2974 2976) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,384 INFO L439 ceAbstractionStarter]: At program point L2975-3(lines 2974 2976) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,385 INFO L439 ceAbstractionStarter]: At program point L2975-2(lines 2974 2976) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,385 INFO L439 ceAbstractionStarter]: At program point L2975-5(lines 2974 2976) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,385 INFO L439 ceAbstractionStarter]: At program point L2975-4(lines 2974 2976) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,385 INFO L443 ceAbstractionStarter]: For program point L2777(lines 2777 2827) no Hoare annotation was computed. [2019-10-22 08:57:56,385 INFO L443 ceAbstractionStarter]: For program point L2645(lines 2645 2649) no Hoare annotation was computed. [2019-10-22 08:57:56,385 INFO L443 ceAbstractionStarter]: For program point L2645-2(lines 2624 2674) no Hoare annotation was computed. [2019-10-22 08:57:56,385 INFO L439 ceAbstractionStarter]: At program point L3042(lines 3041 3043) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,385 INFO L443 ceAbstractionStarter]: For program point L2778(line 2778) no Hoare annotation was computed. [2019-10-22 08:57:56,385 INFO L439 ceAbstractionStarter]: At program point L2580(lines 2410 2582) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nwriters_stress~0 1))) (.cse1 (= ~ldv_state_variable_0~0 1))) (or (and (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0) .cse0 .cse1) (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse0 .cse1))) [2019-10-22 08:57:56,385 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2517) no Hoare annotation was computed. [2019-10-22 08:57:56,386 INFO L439 ceAbstractionStarter]: At program point L2448(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,386 INFO L443 ceAbstractionStarter]: For program point L2779(lines 2779 2783) no Hoare annotation was computed. [2019-10-22 08:57:56,386 INFO L439 ceAbstractionStarter]: At program point L2451(lines 2421 2581) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,386 INFO L439 ceAbstractionStarter]: At program point L2385-1(lines 2379 2392) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,386 INFO L439 ceAbstractionStarter]: At program point L2385(lines 2379 2392) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,386 INFO L443 ceAbstractionStarter]: For program point L2319-1(lines 2319 2323) no Hoare annotation was computed. [2019-10-22 08:57:56,386 INFO L443 ceAbstractionStarter]: For program point L2319(lines 2319 2323) no Hoare annotation was computed. [2019-10-22 08:57:56,386 INFO L439 ceAbstractionStarter]: At program point L2385-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,386 INFO L443 ceAbstractionStarter]: For program point L2319-2(lines 2319 2323) no Hoare annotation was computed. [2019-10-22 08:57:56,386 INFO L443 ceAbstractionStarter]: For program point L2716(line 2716) no Hoare annotation was computed. [2019-10-22 08:57:56,387 INFO L443 ceAbstractionStarter]: For program point L2717(lines 2717 2772) no Hoare annotation was computed. [2019-10-22 08:57:56,387 INFO L439 ceAbstractionStarter]: At program point L2387-1(lines 2379 2392) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,387 INFO L439 ceAbstractionStarter]: At program point L2387(lines 2379 2392) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,387 INFO L439 ceAbstractionStarter]: At program point L2387-2(lines 2379 2392) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0)) [2019-10-22 08:57:56,387 INFO L439 ceAbstractionStarter]: At program point L2123(lines 2119 2125) the Hoare annotation is: false [2019-10-22 08:57:56,387 INFO L443 ceAbstractionStarter]: For program point L2520-1(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 08:57:56,387 INFO L446 ceAbstractionStarter]: At program point L1926(lines 1924 1927) the Hoare annotation is: true [2019-10-22 08:57:56,387 INFO L439 ceAbstractionStarter]: At program point L1926-1(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,387 INFO L439 ceAbstractionStarter]: At program point L1926-2(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,388 INFO L439 ceAbstractionStarter]: At program point L1926-3(lines 1924 1927) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,388 INFO L443 ceAbstractionStarter]: For program point L2785(line 2785) no Hoare annotation was computed. [2019-10-22 08:57:56,388 INFO L443 ceAbstractionStarter]: For program point L2719(lines 2719 2769) no Hoare annotation was computed. [2019-10-22 08:57:56,388 INFO L443 ceAbstractionStarter]: For program point L2786(lines 2786 2790) no Hoare annotation was computed. [2019-10-22 08:57:56,388 INFO L443 ceAbstractionStarter]: For program point L2720(line 2720) no Hoare annotation was computed. [2019-10-22 08:57:56,389 INFO L443 ceAbstractionStarter]: For program point L2786-2(lines 2777 2827) no Hoare annotation was computed. [2019-10-22 08:57:56,389 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 2525) no Hoare annotation was computed. [2019-10-22 08:57:56,389 INFO L439 ceAbstractionStarter]: At program point L2985(lines 2984 2986) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,389 INFO L443 ceAbstractionStarter]: For program point L2721(lines 2721 2725) no Hoare annotation was computed. [2019-10-22 08:57:56,389 INFO L443 ceAbstractionStarter]: For program point L2656(line 2656) no Hoare annotation was computed. [2019-10-22 08:57:56,389 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 08:57:56,389 INFO L439 ceAbstractionStarter]: At program point L3053-1(lines 3052 3054) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,389 INFO L446 ceAbstractionStarter]: At program point L3053(lines 3052 3054) the Hoare annotation is: true [2019-10-22 08:57:56,389 INFO L439 ceAbstractionStarter]: At program point L3053-2(lines 3052 3054) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point L2657(lines 2657 2662) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L439 ceAbstractionStarter]: At program point L2460(lines 2452 2468) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L439 ceAbstractionStarter]: At program point L2989(lines 2988 2990) the Hoare annotation is: false [2019-10-22 08:57:56,390 INFO L439 ceAbstractionStarter]: At program point L2462(lines 2452 2468) the Hoare annotation is: (and (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point L2528-1(lines 2528 2535) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L439 ceAbstractionStarter]: At program point L3057(lines 3056 3058) the Hoare annotation is: false [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point L2397-1(lines 2397 2406) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point L2397(lines 2397 2406) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L443 ceAbstractionStarter]: For program point L2397-2(lines 2397 2406) no Hoare annotation was computed. [2019-10-22 08:57:56,390 INFO L446 ceAbstractionStarter]: At program point L1935(lines 1930 1937) the Hoare annotation is: true [2019-10-22 08:57:56,391 INFO L439 ceAbstractionStarter]: At program point L1935-1(lines 1930 1937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,391 INFO L439 ceAbstractionStarter]: At program point L1869(lines 1864 1871) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,391 INFO L439 ceAbstractionStarter]: At program point L1935-2(lines 1930 1937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,391 INFO L439 ceAbstractionStarter]: At program point L1935-3(lines 1930 1937) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,391 INFO L443 ceAbstractionStarter]: For program point L2728(lines 2728 2732) no Hoare annotation was computed. [2019-10-22 08:57:56,391 INFO L443 ceAbstractionStarter]: For program point L2728-2(lines 2719 2769) no Hoare annotation was computed. [2019-10-22 08:57:56,391 INFO L443 ceAbstractionStarter]: For program point L2530(lines 2530 2533) no Hoare annotation was computed. [2019-10-22 08:57:56,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2009) no Hoare annotation was computed. [2019-10-22 08:57:56,391 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,391 INFO L439 ceAbstractionStarter]: At program point L2993(lines 2992 2994) the Hoare annotation is: false [2019-10-22 08:57:56,392 INFO L439 ceAbstractionStarter]: At program point L2928(lines 2924 2930) the Hoare annotation is: false [2019-10-22 08:57:56,392 INFO L439 ceAbstractionStarter]: At program point L2928-1(lines 2924 2930) the Hoare annotation is: false [2019-10-22 08:57:56,392 INFO L443 ceAbstractionStarter]: For program point L2664(line 2664) no Hoare annotation was computed. [2019-10-22 08:57:56,392 INFO L439 ceAbstractionStarter]: At program point L3061-1(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-3(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-2(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-5(lines 3060 3062) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-4(lines 3060 3062) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-7(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-6(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-9(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,393 INFO L443 ceAbstractionStarter]: For program point L2797(line 2797) no Hoare annotation was computed. [2019-10-22 08:57:56,393 INFO L439 ceAbstractionStarter]: At program point L3061-8(lines 3060 3062) the Hoare annotation is: false [2019-10-22 08:57:56,394 INFO L443 ceAbstractionStarter]: For program point L2665(lines 2665 2670) no Hoare annotation was computed. [2019-10-22 08:57:56,394 INFO L443 ceAbstractionStarter]: For program point L2401-1(lines 2401 2405) no Hoare annotation was computed. [2019-10-22 08:57:56,394 INFO L443 ceAbstractionStarter]: For program point L2401(lines 2401 2405) no Hoare annotation was computed. [2019-10-22 08:57:56,394 INFO L443 ceAbstractionStarter]: For program point L2401-2(lines 2401 2405) no Hoare annotation was computed. [2019-10-22 08:57:56,394 INFO L446 ceAbstractionStarter]: At program point L2005(lines 2891 2900) the Hoare annotation is: true [2019-10-22 08:57:56,394 INFO L439 ceAbstractionStarter]: At program point L2005-1(lines 2891 2900) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,394 INFO L439 ceAbstractionStarter]: At program point L2005-2(lines 2891 2900) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,394 INFO L439 ceAbstractionStarter]: At program point L2005-3(lines 2891 2900) the Hoare annotation is: false [2019-10-22 08:57:56,394 INFO L439 ceAbstractionStarter]: At program point L2005-4(lines 2891 2900) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,394 INFO L443 ceAbstractionStarter]: For program point L2798(lines 2798 2802) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2798-2(lines 2777 2827) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-2(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-3(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-6(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-5(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L439 ceAbstractionStarter]: At program point L2997(lines 2996 2998) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-8(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-9(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2138-11(lines 2138 2151) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2470(lines 2470 2473) no Hoare annotation was computed. [2019-10-22 08:57:56,395 INFO L443 ceAbstractionStarter]: For program point L2470-2(lines 2421 2581) no Hoare annotation was computed. [2019-10-22 08:57:56,396 INFO L443 ceAbstractionStarter]: For program point L2008(line 2008) no Hoare annotation was computed. [2019-10-22 08:57:56,396 INFO L439 ceAbstractionStarter]: At program point L3065(lines 3064 3066) the Hoare annotation is: false [2019-10-22 08:57:56,396 INFO L443 ceAbstractionStarter]: For program point L2008-1(line 2008) no Hoare annotation was computed. [2019-10-22 08:57:56,396 INFO L443 ceAbstractionStarter]: For program point L2008-2(line 2008) no Hoare annotation was computed. [2019-10-22 08:57:56,397 INFO L443 ceAbstractionStarter]: For program point L2008-3(line 2008) no Hoare annotation was computed. [2019-10-22 08:57:56,397 INFO L443 ceAbstractionStarter]: For program point L2008-4(line 2008) no Hoare annotation was computed. [2019-10-22 08:57:56,397 INFO L443 ceAbstractionStarter]: For program point L2538(lines 2538 2546) no Hoare annotation was computed. [2019-10-22 08:57:56,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:56,397 INFO L439 ceAbstractionStarter]: At program point L3001(lines 3000 3002) the Hoare annotation is: false [2019-10-22 08:57:56,397 INFO L439 ceAbstractionStarter]: At program point L2935-1(lines 2931 2937) the Hoare annotation is: false [2019-10-22 08:57:56,397 INFO L439 ceAbstractionStarter]: At program point L2935(lines 2931 2937) the Hoare annotation is: false [2019-10-22 08:57:56,397 INFO L439 ceAbstractionStarter]: At program point L2935-3(lines 2931 2937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,397 INFO L439 ceAbstractionStarter]: At program point L2935-2(lines 2931 2937) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,397 INFO L439 ceAbstractionStarter]: At program point L2935-5(lines 2931 2937) the Hoare annotation is: false [2019-10-22 08:57:56,398 INFO L439 ceAbstractionStarter]: At program point L2935-4(lines 2931 2937) the Hoare annotation is: false [2019-10-22 08:57:56,398 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2542) no Hoare annotation was computed. [2019-10-22 08:57:56,398 INFO L443 ceAbstractionStarter]: For program point L2539-2(lines 2539 2542) no Hoare annotation was computed. [2019-10-22 08:57:56,398 INFO L439 ceAbstractionStarter]: At program point L1879(lines 1874 1881) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,398 INFO L443 ceAbstractionStarter]: For program point L2672(line 2672) no Hoare annotation was computed. [2019-10-22 08:57:56,398 INFO L443 ceAbstractionStarter]: For program point L2474-1(lines 2474 2479) no Hoare annotation was computed. [2019-10-22 08:57:56,398 INFO L439 ceAbstractionStarter]: At program point L2871-1(lines 2866 2873) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,398 INFO L446 ceAbstractionStarter]: At program point L2871(lines 2866 2873) the Hoare annotation is: true [2019-10-22 08:57:56,398 INFO L439 ceAbstractionStarter]: At program point L2871-3(lines 2866 2873) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-10-22 08:57:56,399 INFO L439 ceAbstractionStarter]: At program point L2871-2(lines 2866 2873) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2739(line 2739) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2740(lines 2740 2744) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2740-2(lines 2719 2769) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2146(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2278-3(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2278-6(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2146-2(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2146-1(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 08:57:56,399 INFO L443 ceAbstractionStarter]: For program point L2278-5(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 08:57:56,400 INFO L439 ceAbstractionStarter]: At program point L2080(lines 2077 2082) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-10-22 08:57:56,400 INFO L443 ceAbstractionStarter]: For program point L2278-8(lines 2278 2281) no Hoare annotation was computed. [2019-10-22 08:57:56,400 INFO L443 ceAbstractionStarter]: For program point L2146-3(lines 2146 2149) no Hoare annotation was computed. [2019-10-22 08:57:56,400 INFO L439 ceAbstractionStarter]: At program point L3005(lines 3004 3006) the Hoare annotation is: false [2019-10-22 08:57:56,400 INFO L439 ceAbstractionStarter]: At program point L2147-1(lines 2138 2150) the Hoare annotation is: false [2019-10-22 08:57:56,401 INFO L439 ceAbstractionStarter]: At program point L2147(lines 2138 2150) the Hoare annotation is: false [2019-10-22 08:57:56,401 INFO L439 ceAbstractionStarter]: At program point L3072(lines 3071 3073) the Hoare annotation is: false [2019-10-22 08:57:56,401 INFO L439 ceAbstractionStarter]: At program point L2147-3(lines 2138 2150) the Hoare annotation is: false [2019-10-22 08:57:56,401 INFO L439 ceAbstractionStarter]: At program point L2147-2(lines 2138 2150) the Hoare annotation is: false [2019-10-22 08:57:56,401 INFO L446 ceAbstractionStarter]: At program point L2015(lines 2014 2017) the Hoare annotation is: true [2019-10-22 08:57:56,401 INFO L446 ceAbstractionStarter]: At program point L2015-1(lines 2014 2017) the Hoare annotation is: true [2019-10-22 08:57:56,401 INFO L446 ceAbstractionStarter]: At program point L2015-2(lines 2014 2017) the Hoare annotation is: true [2019-10-22 08:57:56,401 INFO L446 ceAbstractionStarter]: At program point L2015-3(lines 2014 2017) the Hoare annotation is: true [2019-10-22 08:57:56,401 INFO L446 ceAbstractionStarter]: At program point L2015-4(lines 2014 2017) the Hoare annotation is: true [2019-10-22 08:57:56,401 INFO L443 ceAbstractionStarter]: For program point L2809(line 2809) no Hoare annotation was computed. [2019-10-22 08:57:56,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:56 BoogieIcfgContainer [2019-10-22 08:57:56,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:56,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:56,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:56,446 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:56,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:50" (3/4) ... [2019-10-22 08:57:56,450 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:56,474 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 153 nodes and edges [2019-10-22 08:57:56,476 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2019-10-22 08:57:56,477 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-10-22 08:57:56,479 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:57:56,480 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:57:56,482 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:57:56,482 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:57:56,514 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) [2019-10-22 08:57:56,515 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,516 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,517 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,517 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,517 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,517 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,518 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,518 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa [2019-10-22 08:57:56,632 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7fb87525-9f3b-4767-b13c-b52cdbbd1489/bin/uautomizer/witness.graphml [2019-10-22 08:57:56,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:56,634 INFO L168 Benchmark]: Toolchain (without parser) took 10091.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 945.9 MB in the beginning and 990.4 MB in the end (delta: -44.6 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,635 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:56,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1024.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,635 INFO L168 Benchmark]: Boogie Preprocessor took 75.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,636 INFO L168 Benchmark]: RCFGBuilder took 2242.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.3 MB). Peak memory consumption was 205.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,636 INFO L168 Benchmark]: TraceAbstraction took 6438.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,636 INFO L168 Benchmark]: Witness Printer took 186.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 990.4 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:56,638 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1024.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2242.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.3 MB). Peak memory consumption was 205.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6438.00 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.4 MB). Peak memory consumption was 412.2 MB. Max. memory is 11.5 GB. * Witness Printer took 186.26 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 990.4 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 1874]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2077]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3064]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3075]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2984]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2891]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2109]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2092]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2410]: Loop Invariant Derived loop invariant: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2992]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3000]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1964]: Loop Invariant Derived loop invariant: (((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2119]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2109]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2092]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2379]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3041]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3008]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3052]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2169]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2842]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1947]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1864]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3038]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2014]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2866]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3071]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2605]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2988]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2357]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2952]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2974]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2996]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2270]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3004]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2971]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2971]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2924]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2924]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1924]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 336 locations, 5 error locations. Result: SAFE, OverallTime: 6.3s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 5680 SDtfs, 3682 SDslu, 4617 SDs, 0 SdLazy, 191 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5383occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 1630 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 149 LocationsWithAnnotation, 149 PreInvPairs, 550 NumberOfFragments, 2019 HoareAnnotationTreeSize, 149 FomulaSimplifications, 7228 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 149 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 605 NumberOfCodeBlocks, 605 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 593 ConstructedInterpolants, 0 QuantifiedInterpolants, 49703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 94/94 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...