./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 98d07fd41f89960d5d038ffda814c574c3286bbf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:34:11,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:34:11,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:34:11,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:34:11,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:34:11,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:34:11,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:34:11,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:34:11,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:34:11,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:34:11,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:34:11,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:34:11,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:34:11,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:34:11,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:34:11,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:34:11,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:34:11,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:34:11,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:34:11,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:34:11,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:34:11,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:34:11,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:34:11,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:34:11,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:34:11,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:34:11,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:34:11,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:34:11,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:34:11,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:34:11,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:34:11,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:34:11,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:34:11,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:34:11,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:34:11,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:34:11,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:34:11,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:34:11,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:34:11,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:34:11,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:34:11,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-19 23:34:11,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:34:11,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:34:11,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:34:11,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:34:11,609 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:34:11,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:34:11,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:34:11,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:34:11,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:34:11,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:34:11,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:34:11,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:34:11,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:34:11,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:34:11,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:34:11,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:34:11,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:34:11,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:34:11,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:34:11,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:34:11,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:34:11,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:34:11,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:34:11,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:34:11,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:34:11,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 23:34:11,623 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98d07fd41f89960d5d038ffda814c574c3286bbf [2019-11-19 23:34:11,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:34:11,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:34:11,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:34:11,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:34:11,798 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:34:11,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-19 23:34:11,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/data/fb80629f8/9c31c43b47a545d88d05b6ddd0e06f80/FLAGdbe13ea42 [2019-11-19 23:34:12,352 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:34:12,353 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/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-19 23:34:12,381 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/data/fb80629f8/9c31c43b47a545d88d05b6ddd0e06f80/FLAGdbe13ea42 [2019-11-19 23:34:12,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/data/fb80629f8/9c31c43b47a545d88d05b6ddd0e06f80 [2019-11-19 23:34:12,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:34:12,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:34:12,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:34:12,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:34:12,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:34:12,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:34:12" (1/1) ... [2019-11-19 23:34:12,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abefd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:12, skipping insertion in model container [2019-11-19 23:34:12,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:34:12" (1/1) ... [2019-11-19 23:34:12,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:34:12,673 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:34:13,041 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-19 23:34:13,045 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-11-19 23:34:13,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:34:13,507 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:34:13,564 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-19 23:34:13,564 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-11-19 23:34:13,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:34:13,749 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:34:13,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13 WrapperNode [2019-11-19 23:34:13,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:34:13,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:34:13,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:34:13,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:34:13,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:13,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:13,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:34:13,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:34:13,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:34:13,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:34:13,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:13,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:13,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:13,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:13,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:14,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:14,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... [2019-11-19 23:34:14,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:34:14,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:34:14,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:34:14,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:34:14,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:34:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 23:34:14,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 23:34:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:34:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:34:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:34:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:34:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 23:34:14,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 23:34:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 23:34:14,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:34:14,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:34:16,736 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:34:16,736 INFO L285 CfgBuilder]: Removed 344 assume(true) statements. [2019-11-19 23:34:16,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:34:16 BoogieIcfgContainer [2019-11-19 23:34:16,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:34:16,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:34:16,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:34:16,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:34:16,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:34:12" (1/3) ... [2019-11-19 23:34:16,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9096ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:34:16, skipping insertion in model container [2019-11-19 23:34:16,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:34:13" (2/3) ... [2019-11-19 23:34:16,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9096ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:34:16, skipping insertion in model container [2019-11-19 23:34:16,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:34:16" (3/3) ... [2019-11-19 23:34:16,749 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-19 23:34:16,757 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:34:16,764 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-19 23:34:16,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-19 23:34:16,799 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:34:16,799 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:34:16,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:34:16,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:34:16,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:34:16,800 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:34:16,800 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:34:16,800 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:34:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states. [2019-11-19 23:34:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:34:16,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:16,831 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-19 23:34:16,831 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-19 23:34:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -608431788, now seen corresponding path program 1 times [2019-11-19 23:34:16,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:16,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420594574] [2019-11-19 23:34:16,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:17,211 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-19 23:34:17,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420594574] [2019-11-19 23:34:17,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:17,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:17,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194746187] [2019-11-19 23:34:17,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:17,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:17,231 INFO L87 Difference]: Start difference. First operand 336 states. Second operand 3 states. [2019-11-19 23:34:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:17,568 INFO L93 Difference]: Finished difference Result 797 states and 1162 transitions. [2019-11-19 23:34:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:17,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 23:34:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:17,596 INFO L225 Difference]: With dead ends: 797 [2019-11-19 23:34:17,597 INFO L226 Difference]: Without dead ends: 433 [2019-11-19 23:34:17,606 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-19 23:34:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-19 23:34:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-19 23:34:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-19 23:34:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 620 transitions. [2019-11-19 23:34:17,704 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 620 transitions. Word has length 22 [2019-11-19 23:34:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:17,705 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 620 transitions. [2019-11-19 23:34:17,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 620 transitions. [2019-11-19 23:34:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:34:17,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:17,712 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-19 23:34:17,713 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-19 23:34:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 164474749, now seen corresponding path program 1 times [2019-11-19 23:34:17,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:17,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640453840] [2019-11-19 23:34:17,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:17,933 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-19 23:34:17,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640453840] [2019-11-19 23:34:17,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:17,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:34:17,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356092408] [2019-11-19 23:34:17,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:17,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:17,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:17,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:17,936 INFO L87 Difference]: Start difference. First operand 433 states and 620 transitions. Second operand 3 states. [2019-11-19 23:34:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:17,964 INFO L93 Difference]: Finished difference Result 854 states and 1225 transitions. [2019-11-19 23:34:17,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:17,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 23:34:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:17,968 INFO L225 Difference]: With dead ends: 854 [2019-11-19 23:34:17,968 INFO L226 Difference]: Without dead ends: 433 [2019-11-19 23:34:17,970 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-19 23:34:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-19 23:34:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2019-11-19 23:34:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-19 23:34:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 619 transitions. [2019-11-19 23:34:17,986 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 619 transitions. Word has length 27 [2019-11-19 23:34:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:17,987 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 619 transitions. [2019-11-19 23:34:17,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 619 transitions. [2019-11-19 23:34:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 23:34:17,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:17,988 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-19 23:34:17,989 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-19 23:34:17,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash -915481931, now seen corresponding path program 1 times [2019-11-19 23:34:17,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:17,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375126340] [2019-11-19 23:34:17,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:18,116 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-19 23:34:18,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375126340] [2019-11-19 23:34:18,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:18,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:34:18,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309889195] [2019-11-19 23:34:18,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:18,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:18,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:18,118 INFO L87 Difference]: Start difference. First operand 433 states and 619 transitions. Second operand 3 states. [2019-11-19 23:34:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:18,216 INFO L93 Difference]: Finished difference Result 821 states and 1190 transitions. [2019-11-19 23:34:18,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:18,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 23:34:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:18,221 INFO L225 Difference]: With dead ends: 821 [2019-11-19 23:34:18,221 INFO L226 Difference]: Without dead ends: 801 [2019-11-19 23:34:18,222 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-19 23:34:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-11-19 23:34:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2019-11-19 23:34:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-11-19 23:34:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1168 transitions. [2019-11-19 23:34:18,251 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1168 transitions. Word has length 30 [2019-11-19 23:34:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:18,251 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1168 transitions. [2019-11-19 23:34:18,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1168 transitions. [2019-11-19 23:34:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 23:34:18,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:18,254 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-19 23:34:18,254 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-19 23:34:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1741341408, now seen corresponding path program 1 times [2019-11-19 23:34:18,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:18,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006582967] [2019-11-19 23:34:18,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:18,350 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-19 23:34:18,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006582967] [2019-11-19 23:34:18,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:18,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:18,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104058322] [2019-11-19 23:34:18,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:18,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:18,352 INFO L87 Difference]: Start difference. First operand 801 states and 1168 transitions. Second operand 3 states. [2019-11-19 23:34:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:18,507 INFO L93 Difference]: Finished difference Result 2225 states and 3248 transitions. [2019-11-19 23:34:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:18,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-19 23:34:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:18,515 INFO L225 Difference]: With dead ends: 2225 [2019-11-19 23:34:18,516 INFO L226 Difference]: Without dead ends: 1436 [2019-11-19 23:34:18,518 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-19 23:34:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-11-19 23:34:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1416. [2019-11-19 23:34:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-11-19 23:34:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2074 transitions. [2019-11-19 23:34:18,589 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2074 transitions. Word has length 37 [2019-11-19 23:34:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:18,589 INFO L462 AbstractCegarLoop]: Abstraction has 1416 states and 2074 transitions. [2019-11-19 23:34:18,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2074 transitions. [2019-11-19 23:34:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 23:34:18,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:18,594 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-19 23:34:18,596 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-19 23:34:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash -548172063, now seen corresponding path program 1 times [2019-11-19 23:34:18,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:18,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130973562] [2019-11-19 23:34:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:18,709 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-19 23:34:18,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130973562] [2019-11-19 23:34:18,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:18,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:18,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123673712] [2019-11-19 23:34:18,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:18,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:18,711 INFO L87 Difference]: Start difference. First operand 1416 states and 2074 transitions. Second operand 3 states. [2019-11-19 23:34:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:18,926 INFO L93 Difference]: Finished difference Result 3922 states and 5746 transitions. [2019-11-19 23:34:18,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:18,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-19 23:34:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:18,940 INFO L225 Difference]: With dead ends: 3922 [2019-11-19 23:34:18,941 INFO L226 Difference]: Without dead ends: 2518 [2019-11-19 23:34:18,943 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-19 23:34:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-11-19 23:34:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2498. [2019-11-19 23:34:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-11-19 23:34:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3662 transitions. [2019-11-19 23:34:19,037 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3662 transitions. Word has length 41 [2019-11-19 23:34:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:19,037 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 3662 transitions. [2019-11-19 23:34:19,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3662 transitions. [2019-11-19 23:34:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 23:34:19,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:19,040 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-19 23:34:19,040 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-19 23:34:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:19,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1040933221, now seen corresponding path program 1 times [2019-11-19 23:34:19,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:19,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547888381] [2019-11-19 23:34:19,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:19,106 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-19 23:34:19,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547888381] [2019-11-19 23:34:19,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:19,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:19,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74307578] [2019-11-19 23:34:19,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:19,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:19,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:19,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:19,108 INFO L87 Difference]: Start difference. First operand 2498 states and 3662 transitions. Second operand 3 states. [2019-11-19 23:34:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:19,250 INFO L93 Difference]: Finished difference Result 6402 states and 9436 transitions. [2019-11-19 23:34:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:19,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-19 23:34:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:19,272 INFO L225 Difference]: With dead ends: 6402 [2019-11-19 23:34:19,272 INFO L226 Difference]: Without dead ends: 3916 [2019-11-19 23:34:19,276 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-19 23:34:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2019-11-19 23:34:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 2506. [2019-11-19 23:34:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-19 23:34:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3670 transitions. [2019-11-19 23:34:19,402 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3670 transitions. Word has length 42 [2019-11-19 23:34:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:19,402 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 3670 transitions. [2019-11-19 23:34:19,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3670 transitions. [2019-11-19 23:34:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 23:34:19,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:19,405 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-19 23:34:19,405 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-19 23:34:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1181481831, now seen corresponding path program 1 times [2019-11-19 23:34:19,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:19,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802993664] [2019-11-19 23:34:19,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:19,483 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-19 23:34:19,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802993664] [2019-11-19 23:34:19,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:19,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:34:19,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906898558] [2019-11-19 23:34:19,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:19,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:19,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:19,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:19,484 INFO L87 Difference]: Start difference. First operand 2506 states and 3670 transitions. Second operand 4 states. [2019-11-19 23:34:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:19,931 INFO L93 Difference]: Finished difference Result 5024 states and 7357 transitions. [2019-11-19 23:34:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:19,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-19 23:34:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:19,944 INFO L225 Difference]: With dead ends: 5024 [2019-11-19 23:34:19,944 INFO L226 Difference]: Without dead ends: 2482 [2019-11-19 23:34:19,949 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-19 23:34:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2019-11-19 23:34:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2474. [2019-11-19 23:34:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-11-19 23:34:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3614 transitions. [2019-11-19 23:34:20,095 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3614 transitions. Word has length 42 [2019-11-19 23:34:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:20,096 INFO L462 AbstractCegarLoop]: Abstraction has 2474 states and 3614 transitions. [2019-11-19 23:34:20,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3614 transitions. [2019-11-19 23:34:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 23:34:20,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:20,100 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-19 23:34:20,100 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-19 23:34:20,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:20,101 INFO L82 PathProgramCache]: Analyzing trace with hash -645054872, now seen corresponding path program 1 times [2019-11-19 23:34:20,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:20,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645786172] [2019-11-19 23:34:20,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:20,247 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-19 23:34:20,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645786172] [2019-11-19 23:34:20,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:20,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:20,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811233097] [2019-11-19 23:34:20,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:20,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:20,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:20,250 INFO L87 Difference]: Start difference. First operand 2474 states and 3614 transitions. Second operand 3 states. [2019-11-19 23:34:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:20,688 INFO L93 Difference]: Finished difference Result 6132 states and 9000 transitions. [2019-11-19 23:34:20,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:20,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-19 23:34:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:20,708 INFO L225 Difference]: With dead ends: 6132 [2019-11-19 23:34:20,708 INFO L226 Difference]: Without dead ends: 3670 [2019-11-19 23:34:20,712 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-19 23:34:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-19 23:34:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3646. [2019-11-19 23:34:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3646 states. [2019-11-19 23:34:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 5320 transitions. [2019-11-19 23:34:20,867 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 5320 transitions. Word has length 65 [2019-11-19 23:34:20,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:20,868 INFO L462 AbstractCegarLoop]: Abstraction has 3646 states and 5320 transitions. [2019-11-19 23:34:20,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 5320 transitions. [2019-11-19 23:34:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-19 23:34:20,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:20,871 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-19 23:34:20,871 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-19 23:34:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 108258473, now seen corresponding path program 1 times [2019-11-19 23:34:20,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:20,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124434269] [2019-11-19 23:34:20,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:20,970 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-19 23:34:20,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124434269] [2019-11-19 23:34:20,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:20,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:34:20,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532508180] [2019-11-19 23:34:20,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:20,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:20,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:20,972 INFO L87 Difference]: Start difference. First operand 3646 states and 5320 transitions. Second operand 3 states. [2019-11-19 23:34:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:21,346 INFO L93 Difference]: Finished difference Result 9043 states and 13258 transitions. [2019-11-19 23:34:21,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:21,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-19 23:34:21,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:21,374 INFO L225 Difference]: With dead ends: 9043 [2019-11-19 23:34:21,374 INFO L226 Difference]: Without dead ends: 5409 [2019-11-19 23:34:21,380 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-19 23:34:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-11-19 23:34:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 5383. [2019-11-19 23:34:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5383 states. [2019-11-19 23:34:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 7840 transitions. [2019-11-19 23:34:21,571 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 7840 transitions. Word has length 69 [2019-11-19 23:34:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:21,572 INFO L462 AbstractCegarLoop]: Abstraction has 5383 states and 7840 transitions. [2019-11-19 23:34:21,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 7840 transitions. [2019-11-19 23:34:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 23:34:21,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:21,574 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-19 23:34:21,575 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-19 23:34:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1297310612, now seen corresponding path program 1 times [2019-11-19 23:34:21,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:21,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158466652] [2019-11-19 23:34:21,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:21,740 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-19 23:34:21,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158466652] [2019-11-19 23:34:21,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:21,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:34:21,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345252703] [2019-11-19 23:34:21,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:34:21,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:34:21,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:34:21,742 INFO L87 Difference]: Start difference. First operand 5383 states and 7840 transitions. Second operand 5 states. [2019-11-19 23:34:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:22,223 INFO L93 Difference]: Finished difference Result 11476 states and 16665 transitions. [2019-11-19 23:34:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:34:22,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-11-19 23:34:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:22,251 INFO L225 Difference]: With dead ends: 11476 [2019-11-19 23:34:22,252 INFO L226 Difference]: Without dead ends: 5448 [2019-11-19 23:34:22,260 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-19 23:34:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2019-11-19 23:34:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 5326. [2019-11-19 23:34:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-11-19 23:34:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 7733 transitions. [2019-11-19 23:34:22,441 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 7733 transitions. Word has length 75 [2019-11-19 23:34:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:22,442 INFO L462 AbstractCegarLoop]: Abstraction has 5326 states and 7733 transitions. [2019-11-19 23:34:22,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:34:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 7733 transitions. [2019-11-19 23:34:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-19 23:34:22,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:22,447 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-19 23:34:22,447 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-19 23:34:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1590700609, now seen corresponding path program 1 times [2019-11-19 23:34:22,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:22,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146867169] [2019-11-19 23:34:22,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:22,543 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-19 23:34:22,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146867169] [2019-11-19 23:34:22,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:22,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:34:22,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361629052] [2019-11-19 23:34:22,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:34:22,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:34:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:34:22,546 INFO L87 Difference]: Start difference. First operand 5326 states and 7733 transitions. Second operand 3 states. [2019-11-19 23:34:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:22,681 INFO L93 Difference]: Finished difference Result 10604 states and 15397 transitions. [2019-11-19 23:34:22,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:34:22,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-19 23:34:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:22,697 INFO L225 Difference]: With dead ends: 10604 [2019-11-19 23:34:22,697 INFO L226 Difference]: Without dead ends: 5290 [2019-11-19 23:34:22,704 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-19 23:34:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2019-11-19 23:34:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 5290. [2019-11-19 23:34:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5290 states. [2019-11-19 23:34:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7661 transitions. [2019-11-19 23:34:22,879 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7661 transitions. Word has length 77 [2019-11-19 23:34:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:22,879 INFO L462 AbstractCegarLoop]: Abstraction has 5290 states and 7661 transitions. [2019-11-19 23:34:22,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:34:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7661 transitions. [2019-11-19 23:34:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-19 23:34:22,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:34:22,888 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-19 23:34:22,888 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-19 23:34:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:34:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1130087027, now seen corresponding path program 1 times [2019-11-19 23:34:22,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:34:22,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725213754] [2019-11-19 23:34:22,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:34:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:34:23,051 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-19 23:34:23,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725213754] [2019-11-19 23:34:23,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:34:23,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:34:23,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212090930] [2019-11-19 23:34:23,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:34:23,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:34:23,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:34:23,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:34:23,053 INFO L87 Difference]: Start difference. First operand 5290 states and 7661 transitions. Second operand 4 states. [2019-11-19 23:34:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:34:23,175 INFO L93 Difference]: Finished difference Result 5409 states and 7825 transitions. [2019-11-19 23:34:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:34:23,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-19 23:34:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:34:23,176 INFO L225 Difference]: With dead ends: 5409 [2019-11-19 23:34:23,176 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:34:23,185 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-19 23:34:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:34:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:34:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:34:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:34:23,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-19 23:34:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:34:23,187 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:34:23,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:34:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:34:23,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:34:23,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:34:24,664 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2019-11-19 23:34:25,311 INFO L444 ceAbstractionStarter]: For program point L2083-3(lines 2083 2096) no Hoare annotation was computed. [2019-11-19 23:34:25,311 INFO L440 ceAbstractionStarter]: At program point L2083-2(lines 2074 2099) 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-19 23:34:25,311 INFO L440 ceAbstractionStarter]: At program point L2083-5(lines 2074 2099) 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-19 23:34:25,311 INFO L447 ceAbstractionStarter]: At program point L1885(lines 1882 1887) the Hoare annotation is: true [2019-11-19 23:34:25,312 INFO L440 ceAbstractionStarter]: At program point L1885-1(lines 1882 1887) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= |ULTIMATE.start_kmalloc_#res.offset| 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= |ULTIMATE.start_kmalloc_#res.base| 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-19 23:34:25,312 INFO L440 ceAbstractionStarter]: At program point L1885-2(lines 1882 1887) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-19 23:34:25,312 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2000) no Hoare annotation was computed. [2019-11-19 23:34:25,312 INFO L444 ceAbstractionStarter]: For program point L2612(line 2612) no Hoare annotation was computed. [2019-11-19 23:34:25,312 INFO L444 ceAbstractionStarter]: For program point L2613(lines 2613 2668) no Hoare annotation was computed. [2019-11-19 23:34:25,312 INFO L440 ceAbstractionStarter]: At program point L2283-1(lines 2261 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-19 23:34:25,312 INFO L447 ceAbstractionStarter]: At program point L2283(lines 2261 2299) the Hoare annotation is: true [2019-11-19 23:34:25,312 INFO L440 ceAbstractionStarter]: At program point L2283-2(lines 2261 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-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L1953(lines 1953 1960) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L1953-1(lines 1953 1960) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L1953-2(lines 1953 1960) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L1953-3(lines 1953 1960) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L2879(lines 2879 2882) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L2879-2(lines 2879 2882) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L2879-4(lines 2879 2882) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L2879-6(lines 2879 2882) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L2615(lines 2615 2665) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L444 ceAbstractionStarter]: For program point L2879-8(lines 2879 2882) no Hoare annotation was computed. [2019-11-19 23:34:25,313 INFO L440 ceAbstractionStarter]: At program point L2285-1(lines 2261 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-19 23:34:25,314 INFO L447 ceAbstractionStarter]: At program point L2285(lines 2261 2299) the Hoare annotation is: true [2019-11-19 23:34:25,314 INFO L440 ceAbstractionStarter]: At program point L2285-2(lines 2261 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-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2682(line 2682) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2616(line 2616) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L440 ceAbstractionStarter]: At program point L2550(lines 2412 2572) the Hoare annotation is: false [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2418(lines 2418 2422) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2418-2(lines 2412 2572) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L440 ceAbstractionStarter]: At program point L2947(lines 2833 2840) the Hoare annotation is: false [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2683(lines 2683 2698) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2617(lines 2617 2621) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2816(line 2816) no Hoare annotation was computed. [2019-11-19 23:34:25,314 INFO L444 ceAbstractionStarter]: For program point L2750(line 2750) no Hoare annotation was computed. [2019-11-19 23:34:25,315 INFO L440 ceAbstractionStarter]: At program point L2552(lines 2412 2572) the Hoare annotation is: false [2019-11-19 23:34:25,315 INFO L444 ceAbstractionStarter]: For program point L2751(lines 2751 2756) no Hoare annotation was computed. [2019-11-19 23:34:25,315 INFO L444 ceAbstractionStarter]: For program point L2685(lines 2685 2691) no Hoare annotation was computed. [2019-11-19 23:34:25,315 INFO L444 ceAbstractionStarter]: For program point L2685-2(lines 2683 2697) no Hoare annotation was computed. [2019-11-19 23:34:25,315 INFO L447 ceAbstractionStarter]: At program point L2355-2(lines 1 3073) the Hoare annotation is: true [2019-11-19 23:34:25,315 INFO L440 ceAbstractionStarter]: At program point L2355-6(lines 2348 2357) 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-19 23:34:25,315 INFO L440 ceAbstractionStarter]: At program point L2355-9(lines 1 3073) 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-19 23:34:25,315 INFO L444 ceAbstractionStarter]: For program point L2091-1(lines 2091 2094) no Hoare annotation was computed. [2019-11-19 23:34:25,315 INFO L444 ceAbstractionStarter]: For program point L2091(lines 2091 2094) no Hoare annotation was computed. [2019-11-19 23:34:25,315 INFO L447 ceAbstractionStarter]: At program point L1959(lines 1946 1962) the Hoare annotation is: true [2019-11-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L1959-1(lines 1946 1962) 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-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L1959-2(lines 1946 1962) 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-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L2950-2(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L1959-3(lines 1946 1962) 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-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L2950-1(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L2092(lines 2083 2095) 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-19 23:34:25,316 INFO L440 ceAbstractionStarter]: At program point L2092-1(lines 2083 2095) 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-19 23:34:25,316 INFO L444 ceAbstractionStarter]: For program point L2555(lines 2555 2565) no Hoare annotation was computed. [2019-11-19 23:34:25,317 INFO L440 ceAbstractionStarter]: At program point L2555-2(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,318 INFO L444 ceAbstractionStarter]: For program point L2291(line 2291) no Hoare annotation was computed. [2019-11-19 23:34:25,319 INFO L444 ceAbstractionStarter]: For program point L2291-3(line 2291) no Hoare annotation was computed. [2019-11-19 23:34:25,319 INFO L444 ceAbstractionStarter]: For program point L2291-2(lines 2290 2292) no Hoare annotation was computed. [2019-11-19 23:34:25,319 INFO L444 ceAbstractionStarter]: For program point L2291-5(lines 2290 2292) no Hoare annotation was computed. [2019-11-19 23:34:25,319 INFO L444 ceAbstractionStarter]: For program point L2291-6(line 2291) no Hoare annotation was computed. [2019-11-19 23:34:25,319 INFO L444 ceAbstractionStarter]: For program point L2291-8(lines 2290 2292) no Hoare annotation was computed. [2019-11-19 23:34:25,319 INFO L440 ceAbstractionStarter]: At program point L2490(lines 2412 2572) the Hoare annotation is: false [2019-11-19 23:34:25,320 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2000) no Hoare annotation was computed. [2019-11-19 23:34:25,320 INFO L444 ceAbstractionStarter]: For program point L2292-1(line 2292) no Hoare annotation was computed. [2019-11-19 23:34:25,320 INFO L444 ceAbstractionStarter]: For program point L2292-3(line 2292) no Hoare annotation was computed. [2019-11-19 23:34:25,320 INFO L444 ceAbstractionStarter]: For program point L2292-5(line 2292) no Hoare annotation was computed. [2019-11-19 23:34:25,320 INFO L440 ceAbstractionStarter]: At program point L2953-1(lines 2849 2856) the Hoare annotation is: false [2019-11-19 23:34:25,320 INFO L440 ceAbstractionStarter]: At program point L2953(lines 2849 2856) the Hoare annotation is: false [2019-11-19 23:34:25,321 INFO L440 ceAbstractionStarter]: At program point L2953-2(lines 2849 2856) 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-19 23:34:25,321 INFO L444 ceAbstractionStarter]: For program point L2623(line 2623) no Hoare annotation was computed. [2019-11-19 23:34:25,321 INFO L440 ceAbstractionStarter]: At program point L3020(lines 3019 3021) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-19 23:34:25,321 INFO L440 ceAbstractionStarter]: At program point L3020-2(lines 3019 3021) 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-19 23:34:25,321 INFO L440 ceAbstractionStarter]: At program point L3020-1(lines 3019 3021) 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-19 23:34:25,321 INFO L444 ceAbstractionStarter]: For program point L2624(lines 2624 2628) no Hoare annotation was computed. [2019-11-19 23:34:25,323 INFO L444 ceAbstractionStarter]: For program point L2624-2(lines 2615 2665) no Hoare annotation was computed. [2019-11-19 23:34:25,323 INFO L440 ceAbstractionStarter]: At program point L2492(lines 2412 2572) the Hoare annotation is: false [2019-11-19 23:34:25,323 INFO L444 ceAbstractionStarter]: For program point L2294(lines 2294 2297) no Hoare annotation was computed. [2019-11-19 23:34:25,323 INFO L444 ceAbstractionStarter]: For program point L2294-2(lines 2294 2297) no Hoare annotation was computed. [2019-11-19 23:34:25,323 INFO L447 ceAbstractionStarter]: At program point L2294-1(lines 2252 2300) the Hoare annotation is: true [2019-11-19 23:34:25,323 INFO L444 ceAbstractionStarter]: For program point L2294-4(lines 2294 2297) no Hoare annotation was computed. [2019-11-19 23:34:25,324 INFO L440 ceAbstractionStarter]: At program point L2294-3(lines 2252 2300) 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-19 23:34:25,324 INFO L440 ceAbstractionStarter]: At program point L2294-5(lines 2252 2300) 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-19 23:34:25,324 INFO L444 ceAbstractionStarter]: For program point L2823(line 2823) no Hoare annotation was computed. [2019-11-19 23:34:25,324 INFO L444 ceAbstractionStarter]: For program point L2758(line 2758) no Hoare annotation was computed. [2019-11-19 23:34:25,324 INFO L444 ceAbstractionStarter]: For program point L2560(lines 2560 2563) no Hoare annotation was computed. [2019-11-19 23:34:25,324 INFO L440 ceAbstractionStarter]: At program point L2957-1(lines 2956 2958) the Hoare annotation is: false [2019-11-19 23:34:25,324 INFO L440 ceAbstractionStarter]: At program point L2957(lines 2956 2958) the Hoare annotation is: false [2019-11-19 23:34:25,325 INFO L440 ceAbstractionStarter]: At program point L2561(lines 1 3073) 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-19 23:34:25,325 INFO L444 ceAbstractionStarter]: For program point L2495(lines 2495 2502) no Hoare annotation was computed. [2019-11-19 23:34:25,325 INFO L444 ceAbstractionStarter]: For program point L2495-2(lines 2412 2572) no Hoare annotation was computed. [2019-11-19 23:34:25,325 INFO L440 ceAbstractionStarter]: At program point L3024(lines 3023 3025) 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-19 23:34:25,325 INFO L440 ceAbstractionStarter]: At program point L2826(lines 2596 2831) 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-19 23:34:25,325 INFO L447 ceAbstractionStarter]: At program point L2694(lines 1 3073) the Hoare annotation is: true [2019-11-19 23:34:25,326 INFO L440 ceAbstractionStarter]: At program point L2166(lines 2160 2168) the Hoare annotation is: false [2019-11-19 23:34:25,326 INFO L444 ceAbstractionStarter]: For program point L2497(lines 2497 2500) no Hoare annotation was computed. [2019-11-19 23:34:25,326 INFO L440 ceAbstractionStarter]: At program point L2960(lines 2959 2961) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-19 23:34:25,326 INFO L440 ceAbstractionStarter]: At program point L2960-2(lines 2959 2961) 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-19 23:34:25,326 INFO L440 ceAbstractionStarter]: At program point L2960-1(lines 2959 2961) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-19 23:34:25,326 INFO L440 ceAbstractionStarter]: At program point L2960-4(lines 2959 2961) 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-19 23:34:25,327 INFO L440 ceAbstractionStarter]: At program point L2960-3(lines 2959 2961) 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-19 23:34:25,327 INFO L440 ceAbstractionStarter]: At program point L2960-5(lines 2959 2961) 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-19 23:34:25,327 INFO L444 ceAbstractionStarter]: For program point L2432(lines 2432 2435) no Hoare annotation was computed. [2019-11-19 23:34:25,327 INFO L444 ceAbstractionStarter]: For program point L2366(lines 2366 2369) no Hoare annotation was computed. [2019-11-19 23:34:25,327 INFO L444 ceAbstractionStarter]: For program point L2366-2(lines 2366 2369) no Hoare annotation was computed. [2019-11-19 23:34:25,327 INFO L444 ceAbstractionStarter]: For program point L2366-1(lines 2366 2369) no Hoare annotation was computed. [2019-11-19 23:34:25,327 INFO L444 ceAbstractionStarter]: For program point L1970(lines 1970 1977) no Hoare annotation was computed. [2019-11-19 23:34:25,328 INFO L440 ceAbstractionStarter]: At program point L3027(lines 3026 3028) 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-19 23:34:25,328 INFO L444 ceAbstractionStarter]: For program point L1970-1(lines 1970 1977) no Hoare annotation was computed. [2019-11-19 23:34:25,329 INFO L444 ceAbstractionStarter]: For program point L1970-2(lines 1970 1977) no Hoare annotation was computed. [2019-11-19 23:34:25,329 INFO L440 ceAbstractionStarter]: At program point L2103-1(lines 2100 2105) 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-19 23:34:25,329 INFO L440 ceAbstractionStarter]: At program point L2103(lines 1 3073) 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-19 23:34:25,329 INFO L440 ceAbstractionStarter]: At program point L2103-2(lines 2100 2105) 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-19 23:34:25,329 INFO L447 ceAbstractionStarter]: At program point L2830(lines 2583 2832) the Hoare annotation is: true [2019-11-19 23:34:25,329 INFO L444 ceAbstractionStarter]: For program point L2765(line 2765) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2766(lines 2766 2821) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2700(line 2700) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2370(lines 2370 2384) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2370-2(lines 2370 2384) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2370-3(lines 2370 2384) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2370-6(lines 2370 2384) no Hoare annotation was computed. [2019-11-19 23:34:25,330 INFO L444 ceAbstractionStarter]: For program point L2370-5(lines 2370 2384) no Hoare annotation was computed. [2019-11-19 23:34:25,331 INFO L444 ceAbstractionStarter]: For program point L2370-8(lines 2370 2384) no Hoare annotation was computed. [2019-11-19 23:34:25,331 INFO L444 ceAbstractionStarter]: For program point L2635(line 2635) no Hoare annotation was computed. [2019-11-19 23:34:25,331 INFO L444 ceAbstractionStarter]: For program point L2503-1(lines 2412 2572) no Hoare annotation was computed. [2019-11-19 23:34:25,331 INFO L440 ceAbstractionStarter]: At program point L2437(lines 2412 2572) 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-19 23:34:25,331 INFO L440 ceAbstractionStarter]: At program point L2173-1(lines 2169 2175) the Hoare annotation is: false [2019-11-19 23:34:25,332 INFO L440 ceAbstractionStarter]: At program point L2173(lines 2169 2175) the Hoare annotation is: false [2019-11-19 23:34:25,332 INFO L444 ceAbstractionStarter]: For program point L2768(lines 2768 2818) no Hoare annotation was computed. [2019-11-19 23:34:25,332 INFO L444 ceAbstractionStarter]: For program point L2636(lines 2636 2640) no Hoare annotation was computed. [2019-11-19 23:34:25,332 INFO L444 ceAbstractionStarter]: For program point L2636-2(lines 2615 2665) no Hoare annotation was computed. [2019-11-19 23:34:25,332 INFO L440 ceAbstractionStarter]: At program point L1976(lines 1963 1979) 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-19 23:34:25,332 INFO L440 ceAbstractionStarter]: At program point L1976-1(lines 1963 1979) 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-19 23:34:25,333 INFO L440 ceAbstractionStarter]: At program point L1976-2(lines 1963 1979) 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-19 23:34:25,333 INFO L444 ceAbstractionStarter]: For program point L2769(line 2769) no Hoare annotation was computed. [2019-11-19 23:34:25,333 INFO L440 ceAbstractionStarter]: At program point L2571(lines 2401 2573) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nwriters_stress~0 1))) (.cse1 (= ~ldv_state_variable_0~0 1))) (or (and (<= (+ |ULTIMATE.start_lock_torture_init_#res| 16) 0) .cse0 .cse1) (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (<= (+ |ULTIMATE.start_lock_torture_init_#res| 12) 0) .cse0 .cse1))) [2019-11-19 23:34:25,333 INFO L444 ceAbstractionStarter]: For program point L2505(lines 2505 2508) no Hoare annotation was computed. [2019-11-19 23:34:25,333 INFO L440 ceAbstractionStarter]: At program point L2439(lines 2412 2572) 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-19 23:34:25,333 INFO L444 ceAbstractionStarter]: For program point L2770(lines 2770 2774) no Hoare annotation was computed. [2019-11-19 23:34:25,334 INFO L440 ceAbstractionStarter]: At program point L2970(lines 2969 2971) 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-19 23:34:25,334 INFO L440 ceAbstractionStarter]: At program point L2442(lines 2412 2572) 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-19 23:34:25,334 INFO L440 ceAbstractionStarter]: At program point L2376(lines 2370 2383) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-19 23:34:25,334 INFO L444 ceAbstractionStarter]: For program point L2310(lines 2310 2314) no Hoare annotation was computed. [2019-11-19 23:34:25,334 INFO L440 ceAbstractionStarter]: At program point L2376-2(lines 2370 2383) 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-19 23:34:25,335 INFO L440 ceAbstractionStarter]: At program point L2376-1(lines 2370 2383) 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-19 23:34:25,335 INFO L444 ceAbstractionStarter]: For program point L2310-2(lines 2310 2314) no Hoare annotation was computed. [2019-11-19 23:34:25,335 INFO L444 ceAbstractionStarter]: For program point L2310-1(lines 2310 2314) no Hoare annotation was computed. [2019-11-19 23:34:25,335 INFO L444 ceAbstractionStarter]: For program point L2707(line 2707) no Hoare annotation was computed. [2019-11-19 23:34:25,335 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,335 INFO L447 ceAbstractionStarter]: At program point L3038(lines 3037 3039) the Hoare annotation is: true [2019-11-19 23:34:25,335 INFO L444 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,336 INFO L444 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,336 INFO L440 ceAbstractionStarter]: At program point L3038-2(lines 3037 3039) 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-19 23:34:25,336 INFO L444 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,336 INFO L440 ceAbstractionStarter]: At program point L3038-1(lines 3037 3039) 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-19 23:34:25,336 INFO L444 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,336 INFO L444 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,336 INFO L444 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,337 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2000) no Hoare annotation was computed. [2019-11-19 23:34:25,337 INFO L444 ceAbstractionStarter]: For program point L2708(lines 2708 2763) no Hoare annotation was computed. [2019-11-19 23:34:25,337 INFO L440 ceAbstractionStarter]: At program point L2378(lines 2370 2383) the Hoare annotation is: (and (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_spin~0 0)) [2019-11-19 23:34:25,337 INFO L440 ceAbstractionStarter]: At program point L2378-2(lines 2370 2383) 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-19 23:34:25,337 INFO L440 ceAbstractionStarter]: At program point L2378-1(lines 2370 2383) 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-19 23:34:25,338 INFO L440 ceAbstractionStarter]: At program point L2114(lines 2110 2116) the Hoare annotation is: false [2019-11-19 23:34:25,338 INFO L444 ceAbstractionStarter]: For program point L2511-1(lines 2412 2572) no Hoare annotation was computed. [2019-11-19 23:34:25,338 INFO L440 ceAbstractionStarter]: At program point L2974(lines 2973 2975) the Hoare annotation is: false [2019-11-19 23:34:25,338 INFO L444 ceAbstractionStarter]: For program point L2776(line 2776) no Hoare annotation was computed. [2019-11-19 23:34:25,338 INFO L444 ceAbstractionStarter]: For program point L2710(lines 2710 2760) no Hoare annotation was computed. [2019-11-19 23:34:25,338 INFO L444 ceAbstractionStarter]: For program point L2777(lines 2777 2781) no Hoare annotation was computed. [2019-11-19 23:34:25,338 INFO L444 ceAbstractionStarter]: For program point L2711(line 2711) no Hoare annotation was computed. [2019-11-19 23:34:25,338 INFO L444 ceAbstractionStarter]: For program point L2777-2(lines 2768 2818) no Hoare annotation was computed. [2019-11-19 23:34:25,339 INFO L444 ceAbstractionStarter]: For program point L2513(lines 2513 2516) no Hoare annotation was computed. [2019-11-19 23:34:25,339 INFO L440 ceAbstractionStarter]: At program point L3042(lines 3041 3043) the Hoare annotation is: false [2019-11-19 23:34:25,339 INFO L444 ceAbstractionStarter]: For program point L2712(lines 2712 2716) no Hoare annotation was computed. [2019-11-19 23:34:25,339 INFO L444 ceAbstractionStarter]: For program point L2647(line 2647) no Hoare annotation was computed. [2019-11-19 23:34:25,340 INFO L440 ceAbstractionStarter]: At program point L2978(lines 2977 2979) the Hoare annotation is: false [2019-11-19 23:34:25,340 INFO L444 ceAbstractionStarter]: For program point L2648(lines 2648 2653) no Hoare annotation was computed. [2019-11-19 23:34:25,340 INFO L440 ceAbstractionStarter]: At program point L2913-1(lines 2909 2915) the Hoare annotation is: false [2019-11-19 23:34:25,340 INFO L440 ceAbstractionStarter]: At program point L2913(lines 2909 2915) the Hoare annotation is: false [2019-11-19 23:34:25,340 INFO L440 ceAbstractionStarter]: At program point L2451(lines 2443 2459) 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-19 23:34:25,340 INFO L440 ceAbstractionStarter]: At program point L3046(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,341 INFO L440 ceAbstractionStarter]: At program point L3046-2(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,341 INFO L440 ceAbstractionStarter]: At program point L3046-1(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,341 INFO L440 ceAbstractionStarter]: At program point L3046-4(lines 3045 3047) 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-19 23:34:25,341 INFO L440 ceAbstractionStarter]: At program point L3046-3(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,341 INFO L440 ceAbstractionStarter]: At program point L3046-6(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,341 INFO L440 ceAbstractionStarter]: At program point L3046-5(lines 3045 3047) 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-19 23:34:25,342 INFO L440 ceAbstractionStarter]: At program point L3046-8(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,342 INFO L440 ceAbstractionStarter]: At program point L3046-7(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,342 INFO L440 ceAbstractionStarter]: At program point L3046-9(lines 3045 3047) the Hoare annotation is: false [2019-11-19 23:34:25,342 INFO L444 ceAbstractionStarter]: For program point L2519-1(lines 2519 2526) no Hoare annotation was computed. [2019-11-19 23:34:25,343 INFO L440 ceAbstractionStarter]: At program point L2453(lines 2443 2459) 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-19 23:34:25,343 INFO L440 ceAbstractionStarter]: At program point L2982(lines 2981 2983) 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-19 23:34:25,343 INFO L444 ceAbstractionStarter]: For program point L2718(line 2718) no Hoare annotation was computed. [2019-11-19 23:34:25,343 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2000) no Hoare annotation was computed. [2019-11-19 23:34:25,343 INFO L444 ceAbstractionStarter]: For program point L2388(lines 2388 2397) no Hoare annotation was computed. [2019-11-19 23:34:25,343 INFO L444 ceAbstractionStarter]: For program point L2388-2(lines 2388 2397) no Hoare annotation was computed. [2019-11-19 23:34:25,343 INFO L444 ceAbstractionStarter]: For program point L2388-1(lines 2388 2397) no Hoare annotation was computed. [2019-11-19 23:34:25,344 INFO L447 ceAbstractionStarter]: At program point L1926(lines 1924 1927) the Hoare annotation is: true [2019-11-19 23:34:25,344 INFO L440 ceAbstractionStarter]: At program point L1926-1(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-19 23:34:25,344 INFO L440 ceAbstractionStarter]: At program point L1926-2(lines 1924 1927) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-19 23:34:25,344 INFO L440 ceAbstractionStarter]: At program point L1926-3(lines 1924 1927) the Hoare annotation is: (and (<= (+ ULTIMATE.start_lock_torture_init_~firsterr~0 12) 0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1)) [2019-11-19 23:34:25,344 INFO L444 ceAbstractionStarter]: For program point L2719(lines 2719 2723) no Hoare annotation was computed. [2019-11-19 23:34:25,344 INFO L444 ceAbstractionStarter]: For program point L2719-2(lines 2710 2760) no Hoare annotation was computed. [2019-11-19 23:34:25,345 INFO L444 ceAbstractionStarter]: For program point L2521(lines 2521 2524) no Hoare annotation was computed. [2019-11-19 23:34:25,345 INFO L440 ceAbstractionStarter]: At program point L3050(lines 3049 3051) the Hoare annotation is: false [2019-11-19 23:34:25,345 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2000) no Hoare annotation was computed. [2019-11-19 23:34:25,345 INFO L444 ceAbstractionStarter]: For program point L2655(line 2655) no Hoare annotation was computed. [2019-11-19 23:34:25,345 INFO L440 ceAbstractionStarter]: At program point L2986(lines 2985 2987) the Hoare annotation is: false [2019-11-19 23:34:25,345 INFO L440 ceAbstractionStarter]: At program point L2920(lines 2916 2922) the Hoare annotation is: false [2019-11-19 23:34:25,346 INFO L440 ceAbstractionStarter]: At program point L2920-2(lines 2916 2922) 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-19 23:34:25,346 INFO L440 ceAbstractionStarter]: At program point L2920-1(lines 2916 2922) the Hoare annotation is: false [2019-11-19 23:34:25,346 INFO L440 ceAbstractionStarter]: At program point L2920-4(lines 2916 2922) the Hoare annotation is: false [2019-11-19 23:34:25,346 INFO L444 ceAbstractionStarter]: For program point L2788(line 2788) no Hoare annotation was computed. [2019-11-19 23:34:25,346 INFO L440 ceAbstractionStarter]: At program point L2920-3(lines 2916 2922) 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-19 23:34:25,346 INFO L440 ceAbstractionStarter]: At program point L2920-5(lines 2916 2922) the Hoare annotation is: false [2019-11-19 23:34:25,346 INFO L444 ceAbstractionStarter]: For program point L2656(lines 2656 2661) no Hoare annotation was computed. [2019-11-19 23:34:25,347 INFO L444 ceAbstractionStarter]: For program point L2392(lines 2392 2396) no Hoare annotation was computed. [2019-11-19 23:34:25,347 INFO L444 ceAbstractionStarter]: For program point L2392-2(lines 2392 2396) no Hoare annotation was computed. [2019-11-19 23:34:25,347 INFO L444 ceAbstractionStarter]: For program point L2392-1(lines 2392 2396) no Hoare annotation was computed. [2019-11-19 23:34:25,347 INFO L447 ceAbstractionStarter]: At program point L1996(lines 2876 2885) the Hoare annotation is: true [2019-11-19 23:34:25,347 INFO L440 ceAbstractionStarter]: At program point L1996-1(lines 2876 2885) 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-19 23:34:25,347 INFO L440 ceAbstractionStarter]: At program point L1996-2(lines 2876 2885) 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-19 23:34:25,348 INFO L440 ceAbstractionStarter]: At program point L1996-3(lines 2876 2885) the Hoare annotation is: false [2019-11-19 23:34:25,348 INFO L440 ceAbstractionStarter]: At program point L1996-4(lines 2876 2885) 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-19 23:34:25,348 INFO L444 ceAbstractionStarter]: For program point L2789(lines 2789 2793) no Hoare annotation was computed. [2019-11-19 23:34:25,348 INFO L444 ceAbstractionStarter]: For program point L2789-2(lines 2768 2818) no Hoare annotation was computed. [2019-11-19 23:34:25,348 INFO L444 ceAbstractionStarter]: For program point L2129(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,348 INFO L444 ceAbstractionStarter]: For program point L2129-3(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,348 INFO L444 ceAbstractionStarter]: For program point L2129-2(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2129-5(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2129-6(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2129-9(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2129-8(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2129-11(lines 2129 2142) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2461(lines 2461 2464) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L2461-2(lines 2412 2572) no Hoare annotation was computed. [2019-11-19 23:34:25,349 INFO L444 ceAbstractionStarter]: For program point L1999(line 1999) no Hoare annotation was computed. [2019-11-19 23:34:25,350 INFO L440 ceAbstractionStarter]: At program point L2990(lines 2989 2991) the Hoare annotation is: false [2019-11-19 23:34:25,350 INFO L444 ceAbstractionStarter]: For program point L1999-1(line 1999) no Hoare annotation was computed. [2019-11-19 23:34:25,350 INFO L444 ceAbstractionStarter]: For program point L1999-2(line 1999) no Hoare annotation was computed. [2019-11-19 23:34:25,350 INFO L444 ceAbstractionStarter]: For program point L1999-3(line 1999) no Hoare annotation was computed. [2019-11-19 23:34:25,350 INFO L444 ceAbstractionStarter]: For program point L1999-4(line 1999) no Hoare annotation was computed. [2019-11-19 23:34:25,350 INFO L440 ceAbstractionStarter]: At program point L3057(lines 3056 3058) the Hoare annotation is: false [2019-11-19 23:34:25,350 INFO L447 ceAbstractionStarter]: At program point L1934(lines 1929 1936) the Hoare annotation is: true [2019-11-19 23:34:25,351 INFO L440 ceAbstractionStarter]: 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-19 23:34:25,351 INFO L440 ceAbstractionStarter]: 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-19 23:34:25,351 INFO L440 ceAbstractionStarter]: 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-19 23:34:25,351 INFO L444 ceAbstractionStarter]: For program point L2529(lines 2529 2537) no Hoare annotation was computed. [2019-11-19 23:34:25,351 INFO L440 ceAbstractionStarter]: At program point L1869(lines 1864 1871) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-19 23:34:25,352 INFO L444 ceAbstractionStarter]: For program point L2530(lines 2530 2533) no Hoare annotation was computed. [2019-11-19 23:34:25,352 INFO L444 ceAbstractionStarter]: For program point L2530-2(lines 2530 2533) no Hoare annotation was computed. [2019-11-19 23:34:25,352 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,353 INFO L444 ceAbstractionStarter]: For program point L2663(line 2663) no Hoare annotation was computed. [2019-11-19 23:34:25,353 INFO L444 ceAbstractionStarter]: For program point L2465-1(lines 2465 2470) no Hoare annotation was computed. [2019-11-19 23:34:25,353 INFO L440 ceAbstractionStarter]: At program point L2994(lines 2993 2995) 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-19 23:34:25,354 INFO L444 ceAbstractionStarter]: For program point L2730(line 2730) no Hoare annotation was computed. [2019-11-19 23:34:25,354 INFO L440 ceAbstractionStarter]: At program point L3061(lines 3060 3062) the Hoare annotation is: false [2019-11-19 23:34:25,355 INFO L440 ceAbstractionStarter]: At program point L2863-1(lines 2858 2865) 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-19 23:34:25,355 INFO L447 ceAbstractionStarter]: At program point L2863(lines 2858 2865) the Hoare annotation is: true [2019-11-19 23:34:25,355 INFO L440 ceAbstractionStarter]: At program point L2863-3(lines 2858 2865) 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-19 23:34:25,355 INFO L440 ceAbstractionStarter]: At program point L2863-2(lines 2858 2865) 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-19 23:34:25,355 INFO L444 ceAbstractionStarter]: For program point L2731(lines 2731 2735) no Hoare annotation was computed. [2019-11-19 23:34:25,355 INFO L444 ceAbstractionStarter]: For program point L2731-2(lines 2710 2760) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L444 ceAbstractionStarter]: For program point L2269(lines 2269 2272) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L444 ceAbstractionStarter]: For program point L2269-3(lines 2269 2272) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L444 ceAbstractionStarter]: For program point L2269-2(lines 2269 2272) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L444 ceAbstractionStarter]: For program point L2137-1(lines 2137 2140) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L444 ceAbstractionStarter]: For program point L2269-5(lines 2269 2272) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L444 ceAbstractionStarter]: For program point L2137(lines 2137 2140) no Hoare annotation was computed. [2019-11-19 23:34:25,356 INFO L440 ceAbstractionStarter]: At program point L2071(lines 2068 2073) 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-19 23:34:25,357 INFO L444 ceAbstractionStarter]: For program point L2137-3(lines 2137 2140) no Hoare annotation was computed. [2019-11-19 23:34:25,357 INFO L444 ceAbstractionStarter]: For program point L2269-6(lines 2269 2272) no Hoare annotation was computed. [2019-11-19 23:34:25,357 INFO L444 ceAbstractionStarter]: For program point L2137-2(lines 2137 2140) no Hoare annotation was computed. [2019-11-19 23:34:25,357 INFO L444 ceAbstractionStarter]: For program point L2269-8(lines 2269 2272) no Hoare annotation was computed. [2019-11-19 23:34:25,357 INFO L440 ceAbstractionStarter]: At program point L2138(lines 2129 2141) the Hoare annotation is: false [2019-11-19 23:34:25,357 INFO L440 ceAbstractionStarter]: At program point L2138-2(lines 2129 2141) the Hoare annotation is: false [2019-11-19 23:34:25,357 INFO L440 ceAbstractionStarter]: At program point L2138-1(lines 2129 2141) the Hoare annotation is: false [2019-11-19 23:34:25,358 INFO L447 ceAbstractionStarter]: At program point L2006(lines 2005 2008) the Hoare annotation is: true [2019-11-19 23:34:25,358 INFO L440 ceAbstractionStarter]: At program point L2138-3(lines 2129 2141) the Hoare annotation is: false [2019-11-19 23:34:25,358 INFO L447 ceAbstractionStarter]: At program point L2006-1(lines 2005 2008) the Hoare annotation is: true [2019-11-19 23:34:25,358 INFO L447 ceAbstractionStarter]: At program point L2006-2(lines 2005 2008) the Hoare annotation is: true [2019-11-19 23:34:25,358 INFO L447 ceAbstractionStarter]: At program point L2006-3(lines 2005 2008) the Hoare annotation is: true [2019-11-19 23:34:25,358 INFO L447 ceAbstractionStarter]: At program point L2006-4(lines 2005 2008) the Hoare annotation is: true [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2800(line 2800) no Hoare annotation was computed. [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2801(lines 2801 2806) no Hoare annotation was computed. [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2670(line 2670) no Hoare annotation was computed. [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2274(lines 2274 2277) no Hoare annotation was computed. [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2274-2(lines 2274 2277) no Hoare annotation was computed. [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2274-3(lines 2274 2277) no Hoare annotation was computed. [2019-11-19 23:34:25,359 INFO L444 ceAbstractionStarter]: For program point L2274-6(lines 2274 2277) no Hoare annotation was computed. [2019-11-19 23:34:25,360 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:34:25,360 INFO L444 ceAbstractionStarter]: For program point L2274-5(lines 2274 2277) no Hoare annotation was computed. [2019-11-19 23:34:25,360 INFO L444 ceAbstractionStarter]: For program point L2274-8(lines 2274 2277) no Hoare annotation was computed. [2019-11-19 23:34:25,360 INFO L444 ceAbstractionStarter]: For program point L2671(lines 2671 2705) no Hoare annotation was computed. [2019-11-19 23:34:25,360 INFO L440 ceAbstractionStarter]: At program point L1879(lines 1874 1881) the Hoare annotation is: (and (= 0 ~onoff_interval~0) (= 0 ULTIMATE.start_lock_torture_init_~tmp___0~9) (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 (+ ~nwriters_stress~0 1)) (= ~ldv_state_variable_0~0 1) (= ~ldv_spin~0 0) (= 0 ~lwsa~0.base)) [2019-11-19 23:34:25,360 INFO L444 ceAbstractionStarter]: For program point L2144(lines 2144 2147) no Hoare annotation was computed. [2019-11-19 23:34:25,360 INFO L444 ceAbstractionStarter]: For program point L2144-2(lines 2144 2147) no Hoare annotation was computed. [2019-11-19 23:34:25,361 INFO L440 ceAbstractionStarter]: At program point L2144-1(lines 2117 2150) the Hoare annotation is: false [2019-11-19 23:34:25,361 INFO L444 ceAbstractionStarter]: For program point L2144-4(lines 2144 2147) no Hoare annotation was computed. [2019-11-19 23:34:25,361 INFO L440 ceAbstractionStarter]: At program point L2144-3(lines 2117 2150) the Hoare annotation is: false [2019-11-19 23:34:25,361 INFO L444 ceAbstractionStarter]: For program point L2144-6(lines 2144 2147) no Hoare annotation was computed. [2019-11-19 23:34:25,361 INFO L440 ceAbstractionStarter]: At program point L2144-5(lines 2117 2150) the Hoare annotation is: false [2019-11-19 23:34:25,361 INFO L440 ceAbstractionStarter]: At program point L2144-7(lines 2117 2150) the Hoare annotation is: false [2019-11-19 23:34:25,361 INFO L440 ceAbstractionStarter]: At program point L2871(lines 2867 2873) the Hoare annotation is: false [2019-11-19 23:34:25,362 INFO L444 ceAbstractionStarter]: For program point L2673(lines 2673 2702) no Hoare annotation was computed. [2019-11-19 23:34:25,362 INFO L444 ceAbstractionStarter]: For program point L2475(lines 2475 2483) no Hoare annotation was computed. [2019-11-19 23:34:25,362 INFO L440 ceAbstractionStarter]: At program point L2938(lines 2937 2939) 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-19 23:34:25,362 INFO L444 ceAbstractionStarter]: For program point L2674(line 2674) no Hoare annotation was computed. [2019-11-19 23:34:25,362 INFO L444 ceAbstractionStarter]: For program point L2476(lines 2476 2479) no Hoare annotation was computed. [2019-11-19 23:34:25,362 INFO L444 ceAbstractionStarter]: For program point L2476-2(lines 2476 2479) no Hoare annotation was computed. [2019-11-19 23:34:25,362 INFO L444 ceAbstractionStarter]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2019-11-19 23:34:25,363 INFO L444 ceAbstractionStarter]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2019-11-19 23:34:25,363 INFO L444 ceAbstractionStarter]: For program point L2278-3(lines 2278 2281) no Hoare annotation was computed. [2019-11-19 23:34:25,363 INFO L444 ceAbstractionStarter]: For program point L2278-6(lines 2278 2281) no Hoare annotation was computed. [2019-11-19 23:34:25,363 INFO L444 ceAbstractionStarter]: For program point L2278-5(lines 2278 2281) no Hoare annotation was computed. [2019-11-19 23:34:25,363 INFO L447 ceAbstractionStarter]: At program point L3071-1(lines 1 3073) the Hoare annotation is: true [2019-11-19 23:34:25,363 INFO L444 ceAbstractionStarter]: For program point L2278-8(lines 2278 2281) no Hoare annotation was computed. [2019-11-19 23:34:25,363 INFO L444 ceAbstractionStarter]: For program point L3071(lines 3071 3073) no Hoare annotation was computed. [2019-11-19 23:34:25,364 INFO L440 ceAbstractionStarter]: At program point L3071-3(lines 1 3073) 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-19 23:34:25,364 INFO L444 ceAbstractionStarter]: For program point L3071-2(lines 3071 3073) no Hoare annotation was computed. [2019-11-19 23:34:25,364 INFO L440 ceAbstractionStarter]: At program point L3071-5(lines 1 3073) 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-19 23:34:25,364 INFO L444 ceAbstractionStarter]: For program point L3071-4(lines 3071 3073) no Hoare annotation was computed. [2019-11-19 23:34:25,364 INFO L444 ceAbstractionStarter]: For program point L2675(lines 2675 2680) no Hoare annotation was computed. [2019-11-19 23:34:25,364 INFO L444 ceAbstractionStarter]: For program point L2808(line 2808) no Hoare annotation was computed. [2019-11-19 23:34:25,364 INFO L444 ceAbstractionStarter]: For program point L2742(line 2742) no Hoare annotation was computed. [2019-11-19 23:34:25,365 INFO L440 ceAbstractionStarter]: At program point L2941-1(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,365 INFO L440 ceAbstractionStarter]: At program point L2941(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,365 INFO L440 ceAbstractionStarter]: At program point L2941-3(lines 1 3073) 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-19 23:34:25,365 INFO L440 ceAbstractionStarter]: At program point L2941-2(lines 1 3073) 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-19 23:34:25,365 INFO L440 ceAbstractionStarter]: At program point L2941-5(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,365 INFO L440 ceAbstractionStarter]: At program point L2941-4(lines 1 3073) the Hoare annotation is: false [2019-11-19 23:34:25,366 INFO L444 ceAbstractionStarter]: For program point L2809(lines 2809 2814) no Hoare annotation was computed. [2019-11-19 23:34:25,366 INFO L444 ceAbstractionStarter]: For program point L2743(lines 2743 2748) no Hoare annotation was computed. [2019-11-19 23:34:25,366 INFO L444 ceAbstractionStarter]: For program point L2611(lines 2611 2825) no Hoare annotation was computed. [2019-11-19 23:34:25,366 INFO L444 ceAbstractionStarter]: For program point L2545(lines 2545 2548) no Hoare annotation was computed. [2019-11-19 23:34:25,366 INFO L444 ceAbstractionStarter]: For program point L2083(lines 2083 2096) no Hoare annotation was computed. [2019-11-19 23:34:25,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:34:25 BoogieIcfgContainer [2019-11-19 23:34:25,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:34:25,442 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:34:25,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:34:25,443 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:34:25,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:34:16" (3/4) ... [2019-11-19 23:34:25,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:34:25,517 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 153 nodes and edges [2019-11-19 23:34:25,521 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2019-11-19 23:34:25,524 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-19 23:34:25,527 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 23:34:25,530 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:34:25,533 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 23:34:25,536 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 23:34:25,569 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) [2019-11-19 23:34:25,572 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-19 23:34:25,573 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-19 23:34:25,573 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-19 23:34:25,574 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-19 23:34:25,574 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-19 23:34:25,574 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-19 23:34:25,575 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-19 23:34:25,575 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-19 23:34:25,708 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e4370c1-e861-4691-bed2-dc1e45527e6a/bin/uautomizer/witness.graphml [2019-11-19 23:34:25,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:34:25,710 INFO L168 Benchmark]: Toolchain (without parser) took 13132.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 946.1 MB in the beginning and 961.5 MB in the end (delta: -15.5 MB). Peak memory consumption was 281.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,710 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:34:25,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1159.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,711 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,711 INFO L168 Benchmark]: Boogie Preprocessor took 145.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,711 INFO L168 Benchmark]: RCFGBuilder took 2681.32 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: -19.4 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,712 INFO L168 Benchmark]: TraceAbstraction took 8703.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.0 MB). Peak memory consumption was 405.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,712 INFO L168 Benchmark]: Witness Printer took 266.15 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 961.5 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:34:25,714 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.46 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1159.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -130.8 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 159.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 145.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2681.32 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: -19.4 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8703.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.0 MB). Peak memory consumption was 405.4 MB. Max. memory is 11.5 GB. * Witness Printer took 266.15 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 961.5 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2000]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2000]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2000]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2000]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2000]: 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: 2833]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1929]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3045]: 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: 2348]: 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: 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: 1929]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3045]: 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: 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: 3045]: 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 - InvariantResult [Line: 2596]: 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: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3056]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2412]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3023]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2443]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2973]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2252]: 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: 2261]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2169]: 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: 2169]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2252]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2959]: 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: 2068]: 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: 2959]: 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: 2959]: 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: 2261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2412]: 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: 2959]: 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: 2261]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2252]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2981]: 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: 2412]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2959]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2937]: 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: 2412]: 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: 2959]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2956]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2909]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2956]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2909]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2876]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2370]: 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: 2370]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2876]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2370]: 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: 2583]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2858]: 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: 3041]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2858]: 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: 2261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2412]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3019]: 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: 2876]: 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: 2261]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2261]: Loop Invariant Derived loop invariant: (((((((((0 == onoff_interval && \result == 0) && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && \result == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3019]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2858]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2876]: 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: 2412]: 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: 3019]: 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: 2443]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2412]: 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: 2858]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2110]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2867]: Loop Invariant Derived loop invariant: 0 - 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: 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: 2100]: 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: 2401]: Loop Invariant Derived loop invariant: ((\result + 16 <= 0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) || (((firsterr + 12 <= 0 && \result + 12 <= 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 2083]: Loop Invariant Derived loop invariant: ((((((0 == onoff_interval && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 3049]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3060]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2100]: 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: 2370]: 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: 2370]: 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: 2117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2969]: 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: 2916]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2916]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1963]: 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: 2977]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1963]: 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: 1963]: 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: 2160]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2370]: Loop Invariant Derived loop invariant: 0 == nwriters_stress + 1 && ldv_spin == 0 - InvariantResult [Line: 2117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2074]: 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: 2005]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2849]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2916]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2849]: 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: 2916]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2849]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2916]: 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: 2916]: 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: 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: 1946]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2129]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2074]: 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: 2985]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2005]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3026]: Loop Invariant Derived loop invariant: (0 == tmp___0 && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3037]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2993]: 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: 1946]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3045]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3037]: 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: 1924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1946]: Loop Invariant Derived loop invariant: (((((((0 == onoff_interval && 0 == tmp___0) && lwsa == 0) && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1) && ldv_spin == 0) && 0 == lwsa - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 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: 3037]: Loop Invariant Derived loop invariant: ((firsterr + 12 <= 0 && 0 == tmp___0) && 0 == nwriters_stress + 1) && ldv_state_variable_0 == 1 - InvariantResult [Line: 2129]: 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 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1946]: 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: 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: 8.5s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, HoareTripleCheckerStatistics: 5680 SDtfs, 3682 SDslu, 4617 SDs, 0 SdLazy, 191 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s 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, 7228 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 149 FomulaSimplificationsInter, 411 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s 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...