./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 57f6d30f7ee5c2335f3b3a1f8eedf8b519166f9d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 01:44:16,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 01:44:16,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 01:44:16,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 01:44:16,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 01:44:16,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 01:44:16,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 01:44:16,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 01:44:16,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 01:44:16,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 01:44:16,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 01:44:16,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 01:44:16,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 01:44:16,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 01:44:16,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 01:44:16,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 01:44:16,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 01:44:16,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 01:44:17,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 01:44:17,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 01:44:17,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 01:44:17,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 01:44:17,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 01:44:17,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 01:44:17,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 01:44:17,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 01:44:17,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 01:44:17,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 01:44:17,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 01:44:17,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 01:44:17,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 01:44:17,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 01:44:17,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 01:44:17,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 01:44:17,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 01:44:17,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 01:44:17,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 01:44:17,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 01:44:17,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 01:44:17,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 01:44:17,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 01:44:17,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-28 01:44:17,052 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 01:44:17,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 01:44:17,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 01:44:17,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 01:44:17,055 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 01:44:17,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 01:44:17,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 01:44:17,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 01:44:17,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 01:44:17,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 01:44:17,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 01:44:17,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 01:44:17,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 01:44:17,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 01:44:17,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 01:44:17,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 01:44:17,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 01:44:17,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 01:44:17,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 01:44:17,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 01:44:17,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 01:44:17,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 01:44:17,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 01:44:17,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 01:44:17,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 01:44:17,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 01:44:17,061 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> 57f6d30f7ee5c2335f3b3a1f8eedf8b519166f9d [2019-11-28 01:44:17,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 01:44:17,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 01:44:17,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 01:44:17,403 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 01:44:17,404 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 01:44:17,405 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-28 01:44:17,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e600cf16/edb03cac69054e47b382d7b3812f9e92/FLAGa7cf55fb4 [2019-11-28 01:44:18,108 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 01:44:18,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-28 01:44:18,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e600cf16/edb03cac69054e47b382d7b3812f9e92/FLAGa7cf55fb4 [2019-11-28 01:44:18,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e600cf16/edb03cac69054e47b382d7b3812f9e92 [2019-11-28 01:44:18,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 01:44:18,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 01:44:18,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 01:44:18,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 01:44:18,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 01:44:18,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:44:18" (1/1) ... [2019-11-28 01:44:18,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600f8926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:18, skipping insertion in model container [2019-11-28 01:44:18,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:44:18" (1/1) ... [2019-11-28 01:44:18,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 01:44:18,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 01:44:18,866 WARN L1191 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-28 01:44:18,867 WARN L1191 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-11-28 01:44:19,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 01:44:19,446 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 01:44:19,499 WARN L1191 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-28 01:44:19,500 WARN L1191 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-11-28 01:44:19,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 01:44:19,718 INFO L208 MainTranslator]: Completed translation [2019-11-28 01:44:19,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19 WrapperNode [2019-11-28 01:44:19,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 01:44:19,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 01:44:19,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 01:44:19,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 01:44:19,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 01:44:19,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 01:44:19,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 01:44:19,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 01:44:19,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... [2019-11-28 01:44:19,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 01:44:19,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 01:44:19,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 01:44:19,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 01:44:19,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 01:44:20,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 01:44:20,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 01:44:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 01:44:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 01:44:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 01:44:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 01:44:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 01:44:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 01:44:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 01:44:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 01:44:20,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 01:44:22,486 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 01:44:22,487 INFO L297 CfgBuilder]: Removed 344 assume(true) statements. [2019-11-28 01:44:22,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:44:22 BoogieIcfgContainer [2019-11-28 01:44:22,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 01:44:22,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 01:44:22,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 01:44:22,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 01:44:22,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:44:18" (1/3) ... [2019-11-28 01:44:22,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbae6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:44:22, skipping insertion in model container [2019-11-28 01:44:22,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:44:19" (2/3) ... [2019-11-28 01:44:22,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbae6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:44:22, skipping insertion in model container [2019-11-28 01:44:22,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:44:22" (3/3) ... [2019-11-28 01:44:22,499 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-11-28 01:44:22,510 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 01:44:22,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-28 01:44:22,535 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 01:44:22,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 01:44:22,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 01:44:22,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 01:44:22,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 01:44:22,571 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 01:44:22,571 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 01:44:22,571 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 01:44:22,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 01:44:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-11-28 01:44:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 01:44:22,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:22,620 INFO L410 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-11-28 01:44:22,620 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -608431788, now seen corresponding path program 1 times [2019-11-28 01:44:22,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:22,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175360007] [2019-11-28 01:44:22,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175360007] [2019-11-28 01:44:23,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:23,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:44:23,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311849430] [2019-11-28 01:44:23,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:23,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:23,134 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-11-28 01:44:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:23,441 INFO L93 Difference]: Finished difference Result 797 states and 1162 transitions. [2019-11-28 01:44:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:23,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 01:44:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:23,461 INFO L225 Difference]: With dead ends: 797 [2019-11-28 01:44:23,461 INFO L226 Difference]: Without dead ends: 433 [2019-11-28 01:44:23,467 INFO L630 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-11-28 01:44:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-28 01:44:23,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-28 01:44:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 01:44:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 620 transitions. [2019-11-28 01:44:23,540 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 620 transitions. Word has length 22 [2019-11-28 01:44:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:23,541 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 620 transitions. [2019-11-28 01:44:23,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 620 transitions. [2019-11-28 01:44:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 01:44:23,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:23,544 INFO L410 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-11-28 01:44:23,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:23,545 INFO L82 PathProgramCache]: Analyzing trace with hash 164474749, now seen corresponding path program 1 times [2019-11-28 01:44:23,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:23,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890060350] [2019-11-28 01:44:23,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:23,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890060350] [2019-11-28 01:44:23,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:23,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:44:23,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387451515] [2019-11-28 01:44:23,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:23,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:23,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:23,761 INFO L87 Difference]: Start difference. First operand 433 states and 620 transitions. Second operand 3 states. [2019-11-28 01:44:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:23,788 INFO L93 Difference]: Finished difference Result 854 states and 1225 transitions. [2019-11-28 01:44:23,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:23,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 01:44:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:23,793 INFO L225 Difference]: With dead ends: 854 [2019-11-28 01:44:23,794 INFO L226 Difference]: Without dead ends: 433 [2019-11-28 01:44:23,800 INFO L630 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-11-28 01:44:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-28 01:44:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-28 01:44:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 01:44:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-28 01:44:23,831 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 27 [2019-11-28 01:44:23,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:23,831 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-28 01:44:23,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-28 01:44:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 01:44:23,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:23,834 INFO L410 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-11-28 01:44:23,835 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash -915481931, now seen corresponding path program 1 times [2019-11-28 01:44:23,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:23,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968674809] [2019-11-28 01:44:23,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:23,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968674809] [2019-11-28 01:44:23,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:23,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:44:23,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837471259] [2019-11-28 01:44:23,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:23,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:23,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:23,923 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-28 01:44:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:23,999 INFO L93 Difference]: Finished difference Result 821 states and 1190 transitions. [2019-11-28 01:44:24,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:24,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 01:44:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:24,004 INFO L225 Difference]: With dead ends: 821 [2019-11-28 01:44:24,004 INFO L226 Difference]: Without dead ends: 801 [2019-11-28 01:44:24,005 INFO L630 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-11-28 01:44:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-28 01:44:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2019-11-28 01:44:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-11-28 01:44:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1168 transitions. [2019-11-28 01:44:24,034 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1168 transitions. Word has length 30 [2019-11-28 01:44:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:24,035 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1168 transitions. [2019-11-28 01:44:24,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1168 transitions. [2019-11-28 01:44:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 01:44:24,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:24,038 INFO L410 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-11-28 01:44:24,038 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1741341408, now seen corresponding path program 1 times [2019-11-28 01:44:24,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:24,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914395946] [2019-11-28 01:44:24,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:24,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914395946] [2019-11-28 01:44:24,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:24,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:44:24,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993452599] [2019-11-28 01:44:24,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:24,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:24,107 INFO L87 Difference]: Start difference. First operand 801 states and 1168 transitions. Second operand 3 states. [2019-11-28 01:44:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:24,229 INFO L93 Difference]: Finished difference Result 2225 states and 3248 transitions. [2019-11-28 01:44:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:24,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 01:44:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:24,237 INFO L225 Difference]: With dead ends: 2225 [2019-11-28 01:44:24,238 INFO L226 Difference]: Without dead ends: 1436 [2019-11-28 01:44:24,240 INFO L630 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-11-28 01:44:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-11-28 01:44:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1416. [2019-11-28 01:44:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-28 01:44:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2074 transitions. [2019-11-28 01:44:24,292 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2074 transitions. Word has length 37 [2019-11-28 01:44:24,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:24,292 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2074 transitions. [2019-11-28 01:44:24,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2074 transitions. [2019-11-28 01:44:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 01:44:24,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:24,296 INFO L410 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-11-28 01:44:24,296 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:24,297 INFO L82 PathProgramCache]: Analyzing trace with hash -548172063, now seen corresponding path program 1 times [2019-11-28 01:44:24,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:24,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438614387] [2019-11-28 01:44:24,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:24,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438614387] [2019-11-28 01:44:24,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:24,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:44:24,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884478144] [2019-11-28 01:44:24,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:24,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:24,380 INFO L87 Difference]: Start difference. First operand 1416 states and 2074 transitions. Second operand 3 states. [2019-11-28 01:44:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:24,537 INFO L93 Difference]: Finished difference Result 3922 states and 5746 transitions. [2019-11-28 01:44:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:24,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 01:44:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:24,550 INFO L225 Difference]: With dead ends: 3922 [2019-11-28 01:44:24,551 INFO L226 Difference]: Without dead ends: 2518 [2019-11-28 01:44:24,554 INFO L630 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-11-28 01:44:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-11-28 01:44:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2498. [2019-11-28 01:44:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-11-28 01:44:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3662 transitions. [2019-11-28 01:44:24,659 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3662 transitions. Word has length 41 [2019-11-28 01:44:24,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:24,660 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3662 transitions. [2019-11-28 01:44:24,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3662 transitions. [2019-11-28 01:44:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 01:44:24,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:24,663 INFO L410 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-11-28 01:44:24,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1040933221, now seen corresponding path program 1 times [2019-11-28 01:44:24,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:24,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566225184] [2019-11-28 01:44:24,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 01:44:24,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566225184] [2019-11-28 01:44:24,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:24,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:44:24,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404557602] [2019-11-28 01:44:24,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:24,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:24,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:24,763 INFO L87 Difference]: Start difference. First operand 2498 states and 3662 transitions. Second operand 3 states. [2019-11-28 01:44:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:24,889 INFO L93 Difference]: Finished difference Result 6402 states and 9436 transitions. [2019-11-28 01:44:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:24,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 01:44:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:24,910 INFO L225 Difference]: With dead ends: 6402 [2019-11-28 01:44:24,910 INFO L226 Difference]: Without dead ends: 3916 [2019-11-28 01:44:24,917 INFO L630 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-11-28 01:44:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2019-11-28 01:44:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 2506. [2019-11-28 01:44:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-28 01:44:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3670 transitions. [2019-11-28 01:44:25,104 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3670 transitions. Word has length 42 [2019-11-28 01:44:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:25,104 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 3670 transitions. [2019-11-28 01:44:25,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3670 transitions. [2019-11-28 01:44:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 01:44:25,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:25,108 INFO L410 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-11-28 01:44:25,108 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1181481831, now seen corresponding path program 1 times [2019-11-28 01:44:25,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:25,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828882351] [2019-11-28 01:44:25,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 01:44:25,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828882351] [2019-11-28 01:44:25,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:25,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 01:44:25,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268634769] [2019-11-28 01:44:25,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 01:44:25,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 01:44:25,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 01:44:25,231 INFO L87 Difference]: Start difference. First operand 2506 states and 3670 transitions. Second operand 4 states. [2019-11-28 01:44:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:25,596 INFO L93 Difference]: Finished difference Result 5024 states and 7357 transitions. [2019-11-28 01:44:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 01:44:25,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-28 01:44:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:25,610 INFO L225 Difference]: With dead ends: 5024 [2019-11-28 01:44:25,611 INFO L226 Difference]: Without dead ends: 2482 [2019-11-28 01:44:25,615 INFO L630 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-11-28 01:44:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2019-11-28 01:44:25,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2474. [2019-11-28 01:44:25,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-11-28 01:44:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3614 transitions. [2019-11-28 01:44:25,739 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3614 transitions. Word has length 42 [2019-11-28 01:44:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:25,739 INFO L462 AbstractCegarLoop]: Abstraction has 2474 states and 3614 transitions. [2019-11-28 01:44:25,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 01:44:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3614 transitions. [2019-11-28 01:44:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 01:44:25,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:25,743 INFO L410 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-11-28 01:44:25,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:25,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:25,743 INFO L82 PathProgramCache]: Analyzing trace with hash -645054872, now seen corresponding path program 1 times [2019-11-28 01:44:25,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:25,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684870280] [2019-11-28 01:44:25,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:25,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684870280] [2019-11-28 01:44:25,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:25,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:44:25,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722992931] [2019-11-28 01:44:25,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:25,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:25,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:25,884 INFO L87 Difference]: Start difference. First operand 2474 states and 3614 transitions. Second operand 3 states. [2019-11-28 01:44:26,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:26,233 INFO L93 Difference]: Finished difference Result 6132 states and 9000 transitions. [2019-11-28 01:44:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:26,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-28 01:44:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:26,250 INFO L225 Difference]: With dead ends: 6132 [2019-11-28 01:44:26,251 INFO L226 Difference]: Without dead ends: 3670 [2019-11-28 01:44:26,255 INFO L630 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-11-28 01:44:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-28 01:44:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3646. [2019-11-28 01:44:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2019-11-28 01:44:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5320 transitions. [2019-11-28 01:44:26,398 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 5320 transitions. Word has length 65 [2019-11-28 01:44:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:26,400 INFO L462 AbstractCegarLoop]: Abstraction has 3646 states and 5320 transitions. [2019-11-28 01:44:26,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 5320 transitions. [2019-11-28 01:44:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 01:44:26,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:26,403 INFO L410 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-11-28 01:44:26,403 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash 108258473, now seen corresponding path program 1 times [2019-11-28 01:44:26,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:26,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797233912] [2019-11-28 01:44:26,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:44:26,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797233912] [2019-11-28 01:44:26,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:26,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:44:26,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146711786] [2019-11-28 01:44:26,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:26,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:26,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:26,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:26,550 INFO L87 Difference]: Start difference. First operand 3646 states and 5320 transitions. Second operand 3 states. [2019-11-28 01:44:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:26,910 INFO L93 Difference]: Finished difference Result 9043 states and 13258 transitions. [2019-11-28 01:44:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:26,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-28 01:44:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:26,935 INFO L225 Difference]: With dead ends: 9043 [2019-11-28 01:44:26,935 INFO L226 Difference]: Without dead ends: 5409 [2019-11-28 01:44:26,942 INFO L630 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-11-28 01:44:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-11-28 01:44:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5383. [2019-11-28 01:44:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5383 states. [2019-11-28 01:44:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 7840 transitions. [2019-11-28 01:44:27,180 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 7840 transitions. Word has length 69 [2019-11-28 01:44:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:27,181 INFO L462 AbstractCegarLoop]: Abstraction has 5383 states and 7840 transitions. [2019-11-28 01:44:27,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 7840 transitions. [2019-11-28 01:44:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 01:44:27,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:27,185 INFO L410 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-11-28 01:44:27,186 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1297310612, now seen corresponding path program 1 times [2019-11-28 01:44:27,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:27,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991672720] [2019-11-28 01:44:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 01:44:27,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991672720] [2019-11-28 01:44:27,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:27,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 01:44:27,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061541721] [2019-11-28 01:44:27,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 01:44:27,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 01:44:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 01:44:27,380 INFO L87 Difference]: Start difference. First operand 5383 states and 7840 transitions. Second operand 5 states. [2019-11-28 01:44:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:27,893 INFO L93 Difference]: Finished difference Result 11476 states and 16665 transitions. [2019-11-28 01:44:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 01:44:27,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-28 01:44:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:27,942 INFO L225 Difference]: With dead ends: 11476 [2019-11-28 01:44:27,943 INFO L226 Difference]: Without dead ends: 5448 [2019-11-28 01:44:27,956 INFO L630 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-11-28 01:44:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2019-11-28 01:44:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 5326. [2019-11-28 01:44:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-11-28 01:44:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 7733 transitions. [2019-11-28 01:44:28,132 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 7733 transitions. Word has length 75 [2019-11-28 01:44:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:28,134 INFO L462 AbstractCegarLoop]: Abstraction has 5326 states and 7733 transitions. [2019-11-28 01:44:28,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 01:44:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 7733 transitions. [2019-11-28 01:44:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 01:44:28,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:28,139 INFO L410 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-11-28 01:44:28,139 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1590700609, now seen corresponding path program 1 times [2019-11-28 01:44:28,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:28,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381294840] [2019-11-28 01:44:28,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 01:44:28,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381294840] [2019-11-28 01:44:28,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:28,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:44:28,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651897098] [2019-11-28 01:44:28,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:44:28,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:44:28,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:44:28,232 INFO L87 Difference]: Start difference. First operand 5326 states and 7733 transitions. Second operand 3 states. [2019-11-28 01:44:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:28,375 INFO L93 Difference]: Finished difference Result 10604 states and 15397 transitions. [2019-11-28 01:44:28,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:44:28,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-28 01:44:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:28,388 INFO L225 Difference]: With dead ends: 10604 [2019-11-28 01:44:28,389 INFO L226 Difference]: Without dead ends: 5290 [2019-11-28 01:44:28,396 INFO L630 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-11-28 01:44:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2019-11-28 01:44:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 5290. [2019-11-28 01:44:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2019-11-28 01:44:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7661 transitions. [2019-11-28 01:44:28,550 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7661 transitions. Word has length 77 [2019-11-28 01:44:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:28,551 INFO L462 AbstractCegarLoop]: Abstraction has 5290 states and 7661 transitions. [2019-11-28 01:44:28,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:44:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7661 transitions. [2019-11-28 01:44:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 01:44:28,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:44:28,554 INFO L410 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-11-28 01:44:28,554 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:44:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:44:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1130087027, now seen corresponding path program 1 times [2019-11-28 01:44:28,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:44:28,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105291564] [2019-11-28 01:44:28,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:44:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:44:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 01:44:28,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105291564] [2019-11-28 01:44:28,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:44:28,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 01:44:28,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84502389] [2019-11-28 01:44:28,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 01:44:28,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:44:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 01:44:28,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 01:44:28,695 INFO L87 Difference]: Start difference. First operand 5290 states and 7661 transitions. Second operand 4 states. [2019-11-28 01:44:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:44:28,801 INFO L93 Difference]: Finished difference Result 5409 states and 7825 transitions. [2019-11-28 01:44:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 01:44:28,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-28 01:44:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:44:28,802 INFO L225 Difference]: With dead ends: 5409 [2019-11-28 01:44:28,802 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 01:44:28,808 INFO L630 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-11-28 01:44:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 01:44:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 01:44:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 01:44:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 01:44:28,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-28 01:44:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:44:28,810 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 01:44:28,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 01:44:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 01:44:28,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 01:44:28,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 01:44:30,376 INFO L249 CegarLoopResult]: At program point L1885(lines 1882 1887) the Hoare annotation is: true [2019-11-28 01:44:30,376 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,376 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,377 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1999) no Hoare annotation was computed. [2019-11-28 01:44:30,377 INFO L246 CegarLoopResult]: For program point L2612(lines 2612 2667) no Hoare annotation was computed. [2019-11-28 01:44:30,377 INFO L249 CegarLoopResult]: At program point L2282(lines 2260 2298) the Hoare annotation is: true [2019-11-28 01:44:30,377 INFO L242 CegarLoopResult]: At program point L2282-2(lines 2260 2298) 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-11-28 01:44:30,378 INFO L242 CegarLoopResult]: At program point L2282-1(lines 2260 2298) 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-11-28 01:44:30,378 INFO L246 CegarLoopResult]: For program point L1952(lines 1952 1959) no Hoare annotation was computed. [2019-11-28 01:44:30,378 INFO L246 CegarLoopResult]: For program point L1952-1(lines 1952 1959) no Hoare annotation was computed. [2019-11-28 01:44:30,378 INFO L246 CegarLoopResult]: For program point L1952-2(lines 1952 1959) no Hoare annotation was computed. [2019-11-28 01:44:30,378 INFO L246 CegarLoopResult]: For program point L1952-3(lines 1952 1959) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L246 CegarLoopResult]: For program point L2878(lines 2878 2881) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L246 CegarLoopResult]: For program point L2878-2(lines 2878 2881) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L246 CegarLoopResult]: For program point L2878-4(lines 2878 2881) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L246 CegarLoopResult]: For program point L2878-6(lines 2878 2881) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L246 CegarLoopResult]: For program point L2614(lines 2614 2664) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L246 CegarLoopResult]: For program point L2878-8(lines 2878 2881) no Hoare annotation was computed. [2019-11-28 01:44:30,379 INFO L249 CegarLoopResult]: At program point L2284(lines 2260 2298) the Hoare annotation is: true [2019-11-28 01:44:30,380 INFO L242 CegarLoopResult]: At program point L2284-2(lines 2260 2298) 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-11-28 01:44:30,380 INFO L242 CegarLoopResult]: At program point L2284-1(lines 2260 2298) 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-11-28 01:44:30,380 INFO L246 CegarLoopResult]: For program point L2681(line 2681) no Hoare annotation was computed. [2019-11-28 01:44:30,380 INFO L246 CegarLoopResult]: For program point L2615(line 2615) no Hoare annotation was computed. [2019-11-28 01:44:30,380 INFO L242 CegarLoopResult]: At program point L2549(lines 2411 2571) the Hoare annotation is: false [2019-11-28 01:44:30,380 INFO L246 CegarLoopResult]: For program point L2417(lines 2417 2421) no Hoare annotation was computed. [2019-11-28 01:44:30,380 INFO L246 CegarLoopResult]: For program point L2417-2(lines 2411 2571) no Hoare annotation was computed. [2019-11-28 01:44:30,381 INFO L242 CegarLoopResult]: At program point L2946(lines 2832 2839) the Hoare annotation is: false [2019-11-28 01:44:30,381 INFO L246 CegarLoopResult]: For program point L2682(lines 2682 2697) no Hoare annotation was computed. [2019-11-28 01:44:30,381 INFO L246 CegarLoopResult]: For program point L2616(lines 2616 2620) no Hoare annotation was computed. [2019-11-28 01:44:30,381 INFO L246 CegarLoopResult]: For program point L2815(line 2815) no Hoare annotation was computed. [2019-11-28 01:44:30,381 INFO L246 CegarLoopResult]: For program point L2749(line 2749) no Hoare annotation was computed. [2019-11-28 01:44:30,381 INFO L242 CegarLoopResult]: At program point L2551(lines 2411 2571) the Hoare annotation is: false [2019-11-28 01:44:30,381 INFO L246 CegarLoopResult]: For program point L2750(lines 2750 2755) no Hoare annotation was computed. [2019-11-28 01:44:30,381 INFO L246 CegarLoopResult]: For program point L2684(lines 2684 2690) no Hoare annotation was computed. [2019-11-28 01:44:30,382 INFO L246 CegarLoopResult]: For program point L2684-2(lines 2682 2696) no Hoare annotation was computed. [2019-11-28 01:44:30,382 INFO L249 CegarLoopResult]: At program point L2354-2(lines 1 3066) the Hoare annotation is: true [2019-11-28 01:44:30,382 INFO L242 CegarLoopResult]: At program point L2354-6(lines 2347 2356) 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-11-28 01:44:30,382 INFO L246 CegarLoopResult]: For program point L2090(lines 2090 2093) no Hoare annotation was computed. [2019-11-28 01:44:30,382 INFO L242 CegarLoopResult]: At program point L2354-9(lines 1 3066) 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-11-28 01:44:30,382 INFO L246 CegarLoopResult]: For program point L2090-1(lines 2090 2093) no Hoare annotation was computed. [2019-11-28 01:44:30,382 INFO L249 CegarLoopResult]: At program point L1958(lines 1945 1961) the Hoare annotation is: true [2019-11-28 01:44:30,383 INFO L242 CegarLoopResult]: At program point L1958-1(lines 1945 1961) 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-11-28 01:44:30,383 INFO L242 CegarLoopResult]: At program point L2949-1(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,383 INFO L242 CegarLoopResult]: At program point L1958-2(lines 1945 1961) 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-11-28 01:44:30,383 INFO L242 CegarLoopResult]: At program point L1958-3(lines 1945 1961) 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-11-28 01:44:30,383 INFO L242 CegarLoopResult]: At program point L2949-2(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,383 INFO L242 CegarLoopResult]: At program point L2091-1(lines 2082 2094) 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-11-28 01:44:30,384 INFO L242 CegarLoopResult]: At program point L2091(lines 2082 2094) 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-11-28 01:44:30,384 INFO L246 CegarLoopResult]: For program point L2554(lines 2554 2564) no Hoare annotation was computed. [2019-11-28 01:44:30,384 INFO L242 CegarLoopResult]: At program point L2554-2(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,384 INFO L246 CegarLoopResult]: For program point L2290(line 2290) no Hoare annotation was computed. [2019-11-28 01:44:30,384 INFO L246 CegarLoopResult]: For program point L2290-2(lines 2289 2291) no Hoare annotation was computed. [2019-11-28 01:44:30,384 INFO L246 CegarLoopResult]: For program point L2290-3(line 2290) no Hoare annotation was computed. [2019-11-28 01:44:30,384 INFO L246 CegarLoopResult]: For program point L2290-6(line 2290) no Hoare annotation was computed. [2019-11-28 01:44:30,384 INFO L246 CegarLoopResult]: For program point L2290-5(lines 2289 2291) no Hoare annotation was computed. [2019-11-28 01:44:30,385 INFO L246 CegarLoopResult]: For program point L2290-8(lines 2289 2291) no Hoare annotation was computed. [2019-11-28 01:44:30,385 INFO L242 CegarLoopResult]: At program point L3017-1(lines 3016 3018) 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-11-28 01:44:30,385 INFO L242 CegarLoopResult]: At program point L3017(lines 3016 3018) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-28 01:44:30,385 INFO L242 CegarLoopResult]: At program point L3017-2(lines 3016 3018) 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-11-28 01:44:30,385 INFO L242 CegarLoopResult]: At program point L2489(lines 2411 2571) the Hoare annotation is: false [2019-11-28 01:44:30,385 INFO L246 CegarLoopResult]: For program point L2291-1(line 2291) no Hoare annotation was computed. [2019-11-28 01:44:30,385 INFO L246 CegarLoopResult]: For program point L2291-3(line 2291) no Hoare annotation was computed. [2019-11-28 01:44:30,385 INFO L246 CegarLoopResult]: For program point L2291-5(line 2291) no Hoare annotation was computed. [2019-11-28 01:44:30,386 INFO L242 CegarLoopResult]: At program point L2952(lines 2848 2855) the Hoare annotation is: false [2019-11-28 01:44:30,386 INFO L242 CegarLoopResult]: At program point L2952-2(lines 2848 2855) 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-11-28 01:44:30,386 INFO L242 CegarLoopResult]: At program point L2952-1(lines 2848 2855) the Hoare annotation is: false [2019-11-28 01:44:30,386 INFO L246 CegarLoopResult]: For program point L2622(line 2622) no Hoare annotation was computed. [2019-11-28 01:44:30,386 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1999) no Hoare annotation was computed. [2019-11-28 01:44:30,386 INFO L246 CegarLoopResult]: For program point L2623(lines 2623 2627) no Hoare annotation was computed. [2019-11-28 01:44:30,386 INFO L246 CegarLoopResult]: For program point L2623-2(lines 2614 2664) no Hoare annotation was computed. [2019-11-28 01:44:30,387 INFO L242 CegarLoopResult]: At program point L2491(lines 2411 2571) the Hoare annotation is: false [2019-11-28 01:44:30,387 INFO L249 CegarLoopResult]: At program point L2293-1(lines 2251 2299) the Hoare annotation is: true [2019-11-28 01:44:30,387 INFO L246 CegarLoopResult]: For program point L2293(lines 2293 2296) no Hoare annotation was computed. [2019-11-28 01:44:30,387 INFO L242 CegarLoopResult]: At program point L2293-3(lines 2251 2299) 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-11-28 01:44:30,387 INFO L246 CegarLoopResult]: For program point L2293-2(lines 2293 2296) no Hoare annotation was computed. [2019-11-28 01:44:30,387 INFO L242 CegarLoopResult]: At program point L2293-5(lines 2251 2299) 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-11-28 01:44:30,387 INFO L246 CegarLoopResult]: For program point L2293-4(lines 2293 2296) no Hoare annotation was computed. [2019-11-28 01:44:30,387 INFO L246 CegarLoopResult]: For program point L2822(line 2822) no Hoare annotation was computed. [2019-11-28 01:44:30,388 INFO L242 CegarLoopResult]: At program point L3021(lines 3020 3022) 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-11-28 01:44:30,388 INFO L246 CegarLoopResult]: For program point L2757(line 2757) no Hoare annotation was computed. [2019-11-28 01:44:30,388 INFO L246 CegarLoopResult]: For program point L2559(lines 2559 2562) no Hoare annotation was computed. [2019-11-28 01:44:30,388 INFO L242 CegarLoopResult]: At program point L2956(lines 2955 2957) the Hoare annotation is: false [2019-11-28 01:44:30,388 INFO L242 CegarLoopResult]: At program point L2956-1(lines 2955 2957) the Hoare annotation is: false [2019-11-28 01:44:30,388 INFO L242 CegarLoopResult]: At program point L2560(lines 1 3066) 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-11-28 01:44:30,388 INFO L246 CegarLoopResult]: For program point L2494(lines 2494 2501) no Hoare annotation was computed. [2019-11-28 01:44:30,388 INFO L246 CegarLoopResult]: For program point L2494-2(lines 2411 2571) no Hoare annotation was computed. [2019-11-28 01:44:30,389 INFO L242 CegarLoopResult]: At program point L2825(lines 2595 2830) 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-11-28 01:44:30,389 INFO L249 CegarLoopResult]: At program point L2693(lines 1 3066) the Hoare annotation is: true [2019-11-28 01:44:30,389 INFO L242 CegarLoopResult]: At program point L2165(lines 2159 2167) the Hoare annotation is: false [2019-11-28 01:44:30,389 INFO L242 CegarLoopResult]: At program point L3024(lines 3023 3025) 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-11-28 01:44:30,389 INFO L246 CegarLoopResult]: For program point L2496(lines 2496 2499) no Hoare annotation was computed. [2019-11-28 01:44:30,389 INFO L242 CegarLoopResult]: At program point L2959-1(lines 2958 2960) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-28 01:44:30,389 INFO L242 CegarLoopResult]: At program point L2959(lines 2958 2960) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-28 01:44:30,390 INFO L242 CegarLoopResult]: At program point L2959-3(lines 2958 2960) 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-11-28 01:44:30,390 INFO L242 CegarLoopResult]: At program point L2959-2(lines 2958 2960) 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-11-28 01:44:30,390 INFO L242 CegarLoopResult]: At program point L2959-5(lines 2958 2960) 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-11-28 01:44:30,390 INFO L242 CegarLoopResult]: At program point L2959-4(lines 2958 2960) 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-11-28 01:44:30,390 INFO L246 CegarLoopResult]: For program point L2431(lines 2431 2434) no Hoare annotation was computed. [2019-11-28 01:44:30,390 INFO L246 CegarLoopResult]: For program point L2365-1(lines 2365 2368) no Hoare annotation was computed. [2019-11-28 01:44:30,391 INFO L246 CegarLoopResult]: For program point L2365(lines 2365 2368) no Hoare annotation was computed. [2019-11-28 01:44:30,391 INFO L246 CegarLoopResult]: For program point L2365-2(lines 2365 2368) no Hoare annotation was computed. [2019-11-28 01:44:30,391 INFO L246 CegarLoopResult]: For program point L1969(lines 1969 1976) no Hoare annotation was computed. [2019-11-28 01:44:30,391 INFO L246 CegarLoopResult]: For program point L1969-1(lines 1969 1976) no Hoare annotation was computed. [2019-11-28 01:44:30,391 INFO L246 CegarLoopResult]: For program point L1969-2(lines 1969 1976) no Hoare annotation was computed. [2019-11-28 01:44:30,391 INFO L242 CegarLoopResult]: At program point L2102(lines 1 3066) 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-11-28 01:44:30,391 INFO L242 CegarLoopResult]: At program point L2102-2(lines 2099 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-11-28 01:44:30,392 INFO L242 CegarLoopResult]: At program point L2102-1(lines 2099 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-11-28 01:44:30,392 INFO L249 CegarLoopResult]: At program point L2829(lines 2582 2831) the Hoare annotation is: true [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2764(line 2764) no Hoare annotation was computed. [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2765(lines 2765 2820) no Hoare annotation was computed. [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2699(line 2699) no Hoare annotation was computed. [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2369(lines 2369 2383) no Hoare annotation was computed. [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2369-3(lines 2369 2383) no Hoare annotation was computed. [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2369-2(lines 2369 2383) no Hoare annotation was computed. [2019-11-28 01:44:30,392 INFO L246 CegarLoopResult]: For program point L2369-5(lines 2369 2383) no Hoare annotation was computed. [2019-11-28 01:44:30,393 INFO L246 CegarLoopResult]: For program point L2369-6(lines 2369 2383) no Hoare annotation was computed. [2019-11-28 01:44:30,393 INFO L246 CegarLoopResult]: For program point L2369-8(lines 2369 2383) no Hoare annotation was computed. [2019-11-28 01:44:30,393 INFO L246 CegarLoopResult]: For program point L2634(line 2634) no Hoare annotation was computed. [2019-11-28 01:44:30,393 INFO L242 CegarLoopResult]: At program point L2436(lines 2411 2571) 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-11-28 01:44:30,393 INFO L246 CegarLoopResult]: For program point L2502-1(lines 2411 2571) no Hoare annotation was computed. [2019-11-28 01:44:30,393 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,393 INFO L242 CegarLoopResult]: At program point L2172(lines 2168 2174) the Hoare annotation is: false [2019-11-28 01:44:30,393 INFO L242 CegarLoopResult]: At program point L2172-1(lines 2168 2174) the Hoare annotation is: false [2019-11-28 01:44:30,394 INFO L246 CegarLoopResult]: For program point L2767(lines 2767 2817) no Hoare annotation was computed. [2019-11-28 01:44:30,394 INFO L246 CegarLoopResult]: For program point L2635(lines 2635 2639) no Hoare annotation was computed. [2019-11-28 01:44:30,394 INFO L246 CegarLoopResult]: For program point L2635-2(lines 2614 2664) no Hoare annotation was computed. [2019-11-28 01:44:30,394 INFO L242 CegarLoopResult]: At program point L1975(lines 1962 1978) 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-11-28 01:44:30,394 INFO L242 CegarLoopResult]: At program point L1975-1(lines 1962 1978) 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-11-28 01:44:30,394 INFO L242 CegarLoopResult]: At program point L1975-2(lines 1962 1978) 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-11-28 01:44:30,394 INFO L246 CegarLoopResult]: For program point L2768(line 2768) no Hoare annotation was computed. [2019-11-28 01:44:30,395 INFO L242 CegarLoopResult]: At program point L2570(lines 2400 2572) 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_~firsterr~0 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse0 .cse1) (and (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0) .cse0 .cse1))) [2019-11-28 01:44:30,395 INFO L246 CegarLoopResult]: For program point L2504(lines 2504 2507) no Hoare annotation was computed. [2019-11-28 01:44:30,395 INFO L242 CegarLoopResult]: At program point L2438(lines 2411 2571) 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-11-28 01:44:30,395 INFO L246 CegarLoopResult]: For program point L2769(lines 2769 2773) no Hoare annotation was computed. [2019-11-28 01:44:30,395 INFO L242 CegarLoopResult]: At program point L2968(lines 2967 2969) 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-11-28 01:44:30,395 INFO L242 CegarLoopResult]: At program point L3035-1(lines 3034 3036) 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-11-28 01:44:30,395 INFO L249 CegarLoopResult]: At program point L3035(lines 3034 3036) the Hoare annotation is: true [2019-11-28 01:44:30,396 INFO L242 CegarLoopResult]: 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)) [2019-11-28 01:44:30,396 INFO L242 CegarLoopResult]: At program point L2441(lines 2411 2571) 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-11-28 01:44:30,396 INFO L242 CegarLoopResult]: At program point L2375-1(lines 2369 2382) 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-11-28 01:44:30,396 INFO L242 CegarLoopResult]: At program point L2375(lines 2369 2382) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-28 01:44:30,396 INFO L246 CegarLoopResult]: For program point L2309-1(lines 2309 2313) no Hoare annotation was computed. [2019-11-28 01:44:30,396 INFO L246 CegarLoopResult]: For program point L2309(lines 2309 2313) no Hoare annotation was computed. [2019-11-28 01:44:30,396 INFO L242 CegarLoopResult]: At program point L2375-2(lines 2369 2382) 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-11-28 01:44:30,397 INFO L246 CegarLoopResult]: For program point L2309-2(lines 2309 2313) no Hoare annotation was computed. [2019-11-28 01:44:30,397 INFO L246 CegarLoopResult]: For program point L2706(line 2706) no Hoare annotation was computed. [2019-11-28 01:44:30,397 INFO L246 CegarLoopResult]: For program point L2707(lines 2707 2762) no Hoare annotation was computed. [2019-11-28 01:44:30,397 INFO L242 CegarLoopResult]: At program point L2377-1(lines 2369 2382) 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-11-28 01:44:30,397 INFO L242 CegarLoopResult]: At program point L2377(lines 2369 2382) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-28 01:44:30,397 INFO L242 CegarLoopResult]: At program point L2377-2(lines 2369 2382) 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-11-28 01:44:30,397 INFO L242 CegarLoopResult]: At program point L2113(lines 2109 2115) the Hoare annotation is: false [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L242 CegarLoopResult]: At program point L2972(lines 2971 2973) the Hoare annotation is: false [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,398 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1999) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2510-1(lines 2411 2571) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L242 CegarLoopResult]: At program point L3039(lines 3038 3040) the Hoare annotation is: false [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2775(line 2775) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2709(lines 2709 2759) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2776(lines 2776 2780) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2710(line 2710) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2776-2(lines 2767 2817) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2512(lines 2512 2515) no Hoare annotation was computed. [2019-11-28 01:44:30,399 INFO L246 CegarLoopResult]: For program point L2711(lines 2711 2715) no Hoare annotation was computed. [2019-11-28 01:44:30,400 INFO L242 CegarLoopResult]: At program point L2976(lines 2975 2977) the Hoare annotation is: false [2019-11-28 01:44:30,400 INFO L246 CegarLoopResult]: For program point L2646(line 2646) no Hoare annotation was computed. [2019-11-28 01:44:30,400 INFO L242 CegarLoopResult]: At program point L3043-1(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,400 INFO L242 CegarLoopResult]: At program point L3043(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,400 INFO L242 CegarLoopResult]: At program point L3043-3(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,400 INFO L242 CegarLoopResult]: At program point L3043-2(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,400 INFO L242 CegarLoopResult]: At program point L3043-5(lines 3042 3044) 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-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L3043-4(lines 3042 3044) 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-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L3043-7(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L3043-6(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L3043-9(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L3043-8(lines 3042 3044) the Hoare annotation is: false [2019-11-28 01:44:30,401 INFO L246 CegarLoopResult]: For program point L2647(lines 2647 2652) no Hoare annotation was computed. [2019-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L2912(lines 2908 2914) the Hoare annotation is: false [2019-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L2912-1(lines 2908 2914) the Hoare annotation is: false [2019-11-28 01:44:30,401 INFO L242 CegarLoopResult]: At program point L2450(lines 2442 2458) 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-11-28 01:44:30,402 INFO L242 CegarLoopResult]: At program point L2980(lines 2979 2981) 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-11-28 01:44:30,402 INFO L242 CegarLoopResult]: At program point L2452(lines 2442 2458) 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-11-28 01:44:30,402 INFO L246 CegarLoopResult]: For program point L2518-1(lines 2518 2525) no Hoare annotation was computed. [2019-11-28 01:44:30,402 INFO L242 CegarLoopResult]: At program point L3047(lines 3046 3048) the Hoare annotation is: false [2019-11-28 01:44:30,402 INFO L246 CegarLoopResult]: For program point L2717(line 2717) no Hoare annotation was computed. [2019-11-28 01:44:30,402 INFO L246 CegarLoopResult]: For program point L2387-1(lines 2387 2396) no Hoare annotation was computed. [2019-11-28 01:44:30,402 INFO L246 CegarLoopResult]: For program point L2387(lines 2387 2396) no Hoare annotation was computed. [2019-11-28 01:44:30,402 INFO L246 CegarLoopResult]: For program point L2387-2(lines 2387 2396) no Hoare annotation was computed. [2019-11-28 01:44:30,403 INFO L246 CegarLoopResult]: For program point L2718(lines 2718 2722) no Hoare annotation was computed. [2019-11-28 01:44:30,403 INFO L246 CegarLoopResult]: For program point L2718-2(lines 2709 2759) no Hoare annotation was computed. [2019-11-28 01:44:30,403 INFO L246 CegarLoopResult]: For program point L2520(lines 2520 2523) no Hoare annotation was computed. [2019-11-28 01:44:30,403 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1999) no Hoare annotation was computed. [2019-11-28 01:44:30,403 INFO L249 CegarLoopResult]: At program point L1926(lines 1924 1927) the Hoare annotation is: true [2019-11-28 01:44:30,403 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,403 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,404 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,404 INFO L242 CegarLoopResult]: At program point L2984(lines 2983 2985) the Hoare annotation is: false [2019-11-28 01:44:30,404 INFO L246 CegarLoopResult]: For program point L2654(line 2654) no Hoare annotation was computed. [2019-11-28 01:44:30,404 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1999) no Hoare annotation was computed. [2019-11-28 01:44:30,404 INFO L242 CegarLoopResult]: At program point L2919-1(lines 2915 2921) the Hoare annotation is: false [2019-11-28 01:44:30,404 INFO L242 CegarLoopResult]: At program point L2919(lines 2915 2921) the Hoare annotation is: false [2019-11-28 01:44:30,404 INFO L242 CegarLoopResult]: At program point L2919-3(lines 2915 2921) 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-11-28 01:44:30,404 INFO L242 CegarLoopResult]: At program point L2919-2(lines 2915 2921) 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-11-28 01:44:30,405 INFO L242 CegarLoopResult]: At program point L2919-5(lines 2915 2921) the Hoare annotation is: false [2019-11-28 01:44:30,405 INFO L242 CegarLoopResult]: At program point L2919-4(lines 2915 2921) the Hoare annotation is: false [2019-11-28 01:44:30,405 INFO L246 CegarLoopResult]: For program point L2787(line 2787) no Hoare annotation was computed. [2019-11-28 01:44:30,405 INFO L246 CegarLoopResult]: For program point L2655(lines 2655 2660) no Hoare annotation was computed. [2019-11-28 01:44:30,405 INFO L246 CegarLoopResult]: For program point L2391-1(lines 2391 2395) no Hoare annotation was computed. [2019-11-28 01:44:30,405 INFO L246 CegarLoopResult]: For program point L2391(lines 2391 2395) no Hoare annotation was computed. [2019-11-28 01:44:30,405 INFO L246 CegarLoopResult]: For program point L2391-2(lines 2391 2395) no Hoare annotation was computed. [2019-11-28 01:44:30,405 INFO L249 CegarLoopResult]: At program point L1995(lines 2875 2884) the Hoare annotation is: true [2019-11-28 01:44:30,406 INFO L242 CegarLoopResult]: At program point L1995-1(lines 2875 2884) 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-11-28 01:44:30,406 INFO L242 CegarLoopResult]: At program point L1995-2(lines 2875 2884) 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-11-28 01:44:30,406 INFO L242 CegarLoopResult]: At program point L1995-3(lines 2875 2884) the Hoare annotation is: false [2019-11-28 01:44:30,406 INFO L242 CegarLoopResult]: At program point L1995-4(lines 2875 2884) 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-11-28 01:44:30,406 INFO L246 CegarLoopResult]: For program point L2788(lines 2788 2792) no Hoare annotation was computed. [2019-11-28 01:44:30,406 INFO L246 CegarLoopResult]: For program point L2788-2(lines 2767 2817) no Hoare annotation was computed. [2019-11-28 01:44:30,406 INFO L246 CegarLoopResult]: For program point L2128(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,406 INFO L246 CegarLoopResult]: For program point L2128-2(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2128-3(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2128-6(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2128-5(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2128-8(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2128-9(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2128-11(lines 2128 2141) no Hoare annotation was computed. [2019-11-28 01:44:30,407 INFO L242 CegarLoopResult]: At program point L3054(lines 3053 3055) the Hoare annotation is: false [2019-11-28 01:44:30,407 INFO L242 CegarLoopResult]: At program point L2988(lines 2987 2989) the Hoare annotation is: false [2019-11-28 01:44:30,407 INFO L246 CegarLoopResult]: For program point L2460(lines 2460 2463) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L2460-2(lines 2411 2571) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L1998(line 1998) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L1998-1(line 1998) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L1998-2(line 1998) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L1998-3(line 1998) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L1998-4(line 1998) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L246 CegarLoopResult]: For program point L2528(lines 2528 2536) no Hoare annotation was computed. [2019-11-28 01:44:30,408 INFO L249 CegarLoopResult]: At program point L1934(lines 1929 1936) the Hoare annotation is: true [2019-11-28 01:44:30,408 INFO L242 CegarLoopResult]: At program point L1934-1(lines 1929 1936) 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-11-28 01:44:30,409 INFO L242 CegarLoopResult]: At program point L1934-2(lines 1929 1936) 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-11-28 01:44:30,409 INFO L242 CegarLoopResult]: At program point L1934-3(lines 1929 1936) 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-11-28 01:44:30,409 INFO L246 CegarLoopResult]: For program point L2529(lines 2529 2532) no Hoare annotation was computed. [2019-11-28 01:44:30,409 INFO L246 CegarLoopResult]: For program point L2529-2(lines 2529 2532) no Hoare annotation was computed. [2019-11-28 01:44:30,409 INFO L242 CegarLoopResult]: At program point L3058(lines 3057 3059) the Hoare annotation is: false [2019-11-28 01:44:30,409 INFO L242 CegarLoopResult]: At program point L2992(lines 2991 2993) 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-11-28 01:44:30,409 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,410 INFO L246 CegarLoopResult]: For program point L2662(line 2662) no Hoare annotation was computed. [2019-11-28 01:44:30,410 INFO L246 CegarLoopResult]: For program point L2464-1(lines 2464 2469) no Hoare annotation was computed. [2019-11-28 01:44:30,410 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,410 INFO L246 CegarLoopResult]: For program point L2729(line 2729) no Hoare annotation was computed. [2019-11-28 01:44:30,410 INFO L249 CegarLoopResult]: At program point L2862(lines 2857 2864) the Hoare annotation is: true [2019-11-28 01:44:30,410 INFO L242 CegarLoopResult]: At program point L2862-2(lines 2857 2864) 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-11-28 01:44:30,410 INFO L242 CegarLoopResult]: At program point L2862-1(lines 2857 2864) 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-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2730(lines 2730 2734) no Hoare annotation was computed. [2019-11-28 01:44:30,411 INFO L242 CegarLoopResult]: At program point L2862-3(lines 2857 2864) 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-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2730-2(lines 2709 2759) no Hoare annotation was computed. [2019-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2268(lines 2268 2271) no Hoare annotation was computed. [2019-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2268-2(lines 2268 2271) no Hoare annotation was computed. [2019-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2136(lines 2136 2139) no Hoare annotation was computed. [2019-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2268-3(lines 2268 2271) no Hoare annotation was computed. [2019-11-28 01:44:30,411 INFO L246 CegarLoopResult]: For program point L2268-6(lines 2268 2271) no Hoare annotation was computed. [2019-11-28 01:44:30,412 INFO L246 CegarLoopResult]: For program point L2136-2(lines 2136 2139) no Hoare annotation was computed. [2019-11-28 01:44:30,412 INFO L246 CegarLoopResult]: For program point L2136-1(lines 2136 2139) no Hoare annotation was computed. [2019-11-28 01:44:30,412 INFO L246 CegarLoopResult]: For program point L2268-5(lines 2268 2271) no Hoare annotation was computed. [2019-11-28 01:44:30,412 INFO L242 CegarLoopResult]: At program point L2070(lines 2067 2072) 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-11-28 01:44:30,412 INFO L246 CegarLoopResult]: For program point L2268-8(lines 2268 2271) no Hoare annotation was computed. [2019-11-28 01:44:30,412 INFO L246 CegarLoopResult]: For program point L2136-3(lines 2136 2139) no Hoare annotation was computed. [2019-11-28 01:44:30,412 INFO L242 CegarLoopResult]: At program point L2137-1(lines 2128 2140) the Hoare annotation is: false [2019-11-28 01:44:30,412 INFO L242 CegarLoopResult]: At program point L2137(lines 2128 2140) the Hoare annotation is: false [2019-11-28 01:44:30,412 INFO L242 CegarLoopResult]: At program point L2137-3(lines 2128 2140) the Hoare annotation is: false [2019-11-28 01:44:30,413 INFO L242 CegarLoopResult]: At program point L2137-2(lines 2128 2140) the Hoare annotation is: false [2019-11-28 01:44:30,413 INFO L249 CegarLoopResult]: At program point L2005(lines 2004 2007) the Hoare annotation is: true [2019-11-28 01:44:30,413 INFO L249 CegarLoopResult]: At program point L2005-1(lines 2004 2007) the Hoare annotation is: true [2019-11-28 01:44:30,413 INFO L249 CegarLoopResult]: At program point L2005-2(lines 2004 2007) the Hoare annotation is: true [2019-11-28 01:44:30,413 INFO L249 CegarLoopResult]: At program point L2005-3(lines 2004 2007) the Hoare annotation is: true [2019-11-28 01:44:30,413 INFO L249 CegarLoopResult]: At program point L2005-4(lines 2004 2007) the Hoare annotation is: true [2019-11-28 01:44:30,413 INFO L246 CegarLoopResult]: For program point L2799(line 2799) no Hoare annotation was computed. [2019-11-28 01:44:30,413 INFO L246 CegarLoopResult]: For program point L3064(lines 3064 3066) no Hoare annotation was computed. [2019-11-28 01:44:30,414 INFO L246 CegarLoopResult]: For program point L3064-2(lines 3064 3066) no Hoare annotation was computed. [2019-11-28 01:44:30,414 INFO L249 CegarLoopResult]: At program point L3064-1(lines 1 3066) the Hoare annotation is: true [2019-11-28 01:44:30,414 INFO L246 CegarLoopResult]: For program point L3064-4(lines 3064 3066) no Hoare annotation was computed. [2019-11-28 01:44:30,414 INFO L242 CegarLoopResult]: At program point L3064-3(lines 1 3066) 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-11-28 01:44:30,414 INFO L242 CegarLoopResult]: At program point L3064-5(lines 1 3066) 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-11-28 01:44:30,414 INFO L246 CegarLoopResult]: For program point L2800(lines 2800 2805) no Hoare annotation was computed. [2019-11-28 01:44:30,414 INFO L246 CegarLoopResult]: For program point L2669(line 2669) no Hoare annotation was computed. [2019-11-28 01:44:30,414 INFO L246 CegarLoopResult]: For program point L2273(lines 2273 2276) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2273-3(lines 2273 2276) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2273-2(lines 2273 2276) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2273-5(lines 2273 2276) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2273-6(lines 2273 2276) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2273-8(lines 2273 2276) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2670(lines 2670 2704) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 01:44:30,415 INFO L242 CegarLoopResult]: At program point L2143-1(lines 2116 2149) the Hoare annotation is: false [2019-11-28 01:44:30,415 INFO L246 CegarLoopResult]: For program point L2143(lines 2143 2146) no Hoare annotation was computed. [2019-11-28 01:44:30,416 INFO L242 CegarLoopResult]: At program point L2143-3(lines 2116 2149) the Hoare annotation is: false [2019-11-28 01:44:30,416 INFO L246 CegarLoopResult]: For program point L2143-2(lines 2143 2146) no Hoare annotation was computed. [2019-11-28 01:44:30,416 INFO L242 CegarLoopResult]: At program point L2143-5(lines 2116 2149) the Hoare annotation is: false [2019-11-28 01:44:30,416 INFO L246 CegarLoopResult]: For program point L2143-4(lines 2143 2146) no Hoare annotation was computed. [2019-11-28 01:44:30,416 INFO L242 CegarLoopResult]: At program point L2143-7(lines 2116 2149) the Hoare annotation is: false [2019-11-28 01:44:30,416 INFO L246 CegarLoopResult]: For program point L2143-6(lines 2143 2146) no Hoare annotation was computed. [2019-11-28 01:44:30,416 INFO L242 CegarLoopResult]: 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-11-28 01:44:30,416 INFO L242 CegarLoopResult]: At program point L2870(lines 2866 2872) the Hoare annotation is: false [2019-11-28 01:44:30,416 INFO L246 CegarLoopResult]: For program point L2672(lines 2672 2701) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2474(lines 2474 2482) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L242 CegarLoopResult]: At program point L2937(lines 2936 2938) 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-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2673(line 2673) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2475(lines 2475 2478) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2475-2(lines 2475 2478) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2277(lines 2277 2280) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2277-3(lines 2277 2280) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2277-2(lines 2277 2280) no Hoare annotation was computed. [2019-11-28 01:44:30,417 INFO L246 CegarLoopResult]: For program point L2277-5(lines 2277 2280) no Hoare annotation was computed. [2019-11-28 01:44:30,418 INFO L246 CegarLoopResult]: For program point L2277-6(lines 2277 2280) no Hoare annotation was computed. [2019-11-28 01:44:30,418 INFO L246 CegarLoopResult]: For program point L2277-8(lines 2277 2280) no Hoare annotation was computed. [2019-11-28 01:44:30,418 INFO L246 CegarLoopResult]: For program point L2674(lines 2674 2679) no Hoare annotation was computed. [2019-11-28 01:44:30,418 INFO L246 CegarLoopResult]: For program point L2807(line 2807) no Hoare annotation was computed. [2019-11-28 01:44:30,418 INFO L246 CegarLoopResult]: For program point L2741(line 2741) no Hoare annotation was computed. [2019-11-28 01:44:30,418 INFO L242 CegarLoopResult]: At program point L2940(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,418 INFO L242 CegarLoopResult]: At program point L2940-2(lines 1 3066) 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-11-28 01:44:30,418 INFO L242 CegarLoopResult]: At program point L2940-1(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,418 INFO L242 CegarLoopResult]: At program point L2940-4(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,419 INFO L246 CegarLoopResult]: For program point L2808(lines 2808 2813) no Hoare annotation was computed. [2019-11-28 01:44:30,419 INFO L242 CegarLoopResult]: At program point L2940-3(lines 1 3066) 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-11-28 01:44:30,419 INFO L246 CegarLoopResult]: For program point L2742(lines 2742 2747) no Hoare annotation was computed. [2019-11-28 01:44:30,419 INFO L242 CegarLoopResult]: At program point L2940-5(lines 1 3066) the Hoare annotation is: false [2019-11-28 01:44:30,419 INFO L246 CegarLoopResult]: For program point L2610(lines 2610 2824) no Hoare annotation was computed. [2019-11-28 01:44:30,419 INFO L246 CegarLoopResult]: For program point L2544(lines 2544 2547) no Hoare annotation was computed. [2019-11-28 01:44:30,419 INFO L246 CegarLoopResult]: For program point L2082(lines 2082 2095) no Hoare annotation was computed. [2019-11-28 01:44:30,419 INFO L242 CegarLoopResult]: At program point L2082-2(lines 2073 2098) 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-11-28 01:44:30,420 INFO L246 CegarLoopResult]: For program point L2082-3(lines 2082 2095) no Hoare annotation was computed. [2019-11-28 01:44:30,420 INFO L242 CegarLoopResult]: At program point L2082-5(lines 2073 2098) 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-11-28 01:44:30,420 INFO L246 CegarLoopResult]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-11-28 01:44:30,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:44:30 BoogieIcfgContainer [2019-11-28 01:44:30,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 01:44:30,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 01:44:30,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 01:44:30,487 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 01:44:30,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:44:22" (3/4) ... [2019-11-28 01:44:30,495 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 01:44:30,556 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 152 nodes and edges [2019-11-28 01:44:30,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2019-11-28 01:44:30,561 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-28 01:44:30,564 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 01:44:30,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 01:44:30,570 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 01:44:30,573 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 01:44:30,614 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) [2019-11-28 01:44:30,616 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-11-28 01:44:30,617 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-11-28 01:44:30,617 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-11-28 01:44:30,618 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-11-28 01:44:30,618 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-11-28 01:44:30,618 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-11-28 01:44:30,618 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-11-28 01:44:30,619 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-11-28 01:44:30,794 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 01:44:30,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 01:44:30,796 INFO L168 Benchmark]: Toolchain (without parser) took 12454.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 479.7 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -263.2 MB). Peak memory consumption was 216.5 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,797 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 01:44:30,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1375.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,798 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.07 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,798 INFO L168 Benchmark]: Boogie Preprocessor took 106.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,798 INFO L168 Benchmark]: RCFGBuilder took 2501.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 819.2 MB in the end (delta: 227.6 MB). Peak memory consumption was 227.6 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,799 INFO L168 Benchmark]: TraceAbstraction took 7995.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 819.2 MB in the beginning and 1.3 GB in the end (delta: -441.7 MB). Peak memory consumption was 205.9 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,799 INFO L168 Benchmark]: Witness Printer took 307.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-28 01:44:30,801 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1375.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.07 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2501.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 819.2 MB in the end (delta: 227.6 MB). Peak memory consumption was 227.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7995.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 819.2 MB in the beginning and 1.3 GB in the end (delta: -441.7 MB). Peak memory consumption was 205.9 MB. Max. memory is 11.5 GB. * Witness Printer took 307.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1999]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1999]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1999]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1999]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1999]: 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: 1929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2979]: 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: 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: 2116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1929]: 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: 2082]: 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: 2866]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1929]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1929]: 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 - InvariantResult [Line: 2082]: 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: 2400]: Loop Invariant Derived loop invariant: (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) - InvariantResult [Line: 2099]: 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: 2116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3042]: 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: 2369]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2369]: 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: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2369]: 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: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3034]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3034]: 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: 3023]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2915]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3053]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2915]: 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: 1962]: 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: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2915]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3020]: 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: 1962]: 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: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2987]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3042]: 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: 1962]: 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: 2159]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3042]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2915]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2848]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2848]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2073]: 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: 2915]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2848]: 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: 2004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2915]: 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: 1945]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1945]: 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: 2128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2073]: 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: 2004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2595]: 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: 1945]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1945]: 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: 2411]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2832]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2967]: 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: 2347]: 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: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 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: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - 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: 2975]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3016]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2251]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2260]: 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: 3016]: 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: 2251]: 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: 2442]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2260]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2983]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3016]: 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: 2168]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2168]: Loop Invariant Derived loop invariant: 0 - 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: 2251]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2958]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2936]: 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: 2411]: 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: 2958]: 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: 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: 2067]: 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: 2958]: 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: 2958]: 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: 2260]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3038]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2958]: 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: 2411]: 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: 3046]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3057]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2411]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2958]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2991]: 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: 2955]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2955]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2908]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2908]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2411]: 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: 2442]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2875]: 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: 2369]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2875]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2875]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2369]: 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: ((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: 2369]: 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: 2857]: Loop Invariant Derived loop invariant: 1 - 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: 2411]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2857]: 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: 2857]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2875]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2260]: 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: 2260]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2857]: 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: 2875]: 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: 2260]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2099]: 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: 1924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2411]: 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: 2971]: 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.2s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 5680 SDtfs, 3682 SDslu, 4617 SDs, 0 SdLazy, 191 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s 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: 1.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1630 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 149 LocationsWithAnnotation, 149 PreInvPairs, 550 NumberOfFragments, 2019 HoareAnnotationTreeSize, 149 FomulaSimplifications, 7328 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 149 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s 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...