./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.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_true-unreach-call.cil.out.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/config/TaipanReach.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_true-unreach-call.cil.out.c -s /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94c873f16bd85a0cccd11c4ae0d2828b5585d490 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:01:55,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:01:55,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:01:55,875 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:01:55,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:01:55,875 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:01:55,876 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:01:55,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:01:55,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:01:55,879 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:01:55,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:01:55,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:01:55,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:01:55,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:01:55,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:01:55,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:01:55,883 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:01:55,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:01:55,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:01:55,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:01:55,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:01:55,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:01:55,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:01:55,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:01:55,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:01:55,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:01:55,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:01:55,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:01:55,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:01:55,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:01:55,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:01:55,894 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:01:55,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:01:55,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:01:55,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:01:55,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:01:55,895 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-10 04:01:55,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:01:55,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:01:55,906 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:01:55,906 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:01:55,906 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:01:55,906 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:01:55,906 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:01:55,906 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:01:55,907 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-10 04:01:55,907 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:01:55,907 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:01:55,907 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:01:55,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:01:55,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:01:55,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:01:55,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:01:55,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:01:55,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:01:55,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:01:55,909 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:01:55,909 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:01:55,909 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:01:55,910 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:01:55,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:01:55,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:01:55,910 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:01:55,910 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-10 04:01:55,910 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan 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 -> Taipan 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 -> 94c873f16bd85a0cccd11c4ae0d2828b5585d490 [2018-11-10 04:01:55,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:01:55,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:01:55,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:01:55,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:01:55,946 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:01:55,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/../../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_true-unreach-call.cil.out.c [2018-11-10 04:01:55,982 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/data/ceac85cbb/e66049e484b2405980ffce654ca64582/FLAGbbc8b3150 [2018-11-10 04:01:56,460 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:01:56,460 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/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_true-unreach-call.cil.out.c [2018-11-10 04:01:56,475 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/data/ceac85cbb/e66049e484b2405980ffce654ca64582/FLAGbbc8b3150 [2018-11-10 04:01:56,486 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/data/ceac85cbb/e66049e484b2405980ffce654ca64582 [2018-11-10 04:01:56,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:01:56,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:01:56,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:56,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:01:56,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:01:56,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:56" (1/1) ... [2018-11-10 04:01:56,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a77aeef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:56, skipping insertion in model container [2018-11-10 04:01:56,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:01:56" (1/1) ... [2018-11-10 04:01:56,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:01:56,542 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:01:56,725 WARN L1126 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1756] [2018-11-10 04:01:56,726 WARN L1126 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1757-1758] [2018-11-10 04:01:56,960 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:56,974 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:01:57,079 WARN L1126 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1756] [2018-11-10 04:01:57,079 WARN L1126 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1757-1758] [2018-11-10 04:01:57,137 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:01:57,176 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:01:57,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57 WrapperNode [2018-11-10 04:01:57,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:01:57,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:57,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:01:57,177 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:01:57,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:01:57,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:01:57,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:01:57,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:01:57,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... [2018-11-10 04:01:57,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:01:57,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:01:57,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:01:57,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:01:57,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/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 [2018-11-10 04:01:57,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_5 [2018-11-10 04:01:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_5 [2018-11-10 04:01:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2018-11-10 04:01:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2018-11-10 04:01:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure bitmap_weight [2018-11-10 04:01:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure bitmap_weight [2018-11-10 04:01:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-10 04:01:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-10 04:01:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_weight [2018-11-10 04:01:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_weight [2018-11-10 04:01:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-10 04:01:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-10 04:01:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2018-11-10 04:01:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2018-11-10 04:01:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2018-11-10 04:01:57,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2018-11-10 04:01:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-11-10 04:01:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-11-10 04:01:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2018-11-10 04:01:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2018-11-10 04:01:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2018-11-10 04:01:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2018-11-10 04:01:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2018-11-10 04:01:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2018-11-10 04:01:57,369 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_printk [2018-11-10 04:01:57,369 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_printk [2018-11-10 04:01:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-10 04:01:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-10 04:01:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2018-11-10 04:01:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2018-11-10 04:01:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2018-11-10 04:01:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2018-11-10 04:01:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:01:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:01:57,370 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2018-11-10 04:01:57,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2018-11-10 04:01:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2018-11-10 04:01:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2018-11-10 04:01:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:01:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:01:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-10 04:01:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2018-11-10 04:01:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2018-11-10 04:01:57,371 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2018-11-10 04:01:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_8 [2018-11-10 04:01:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_8 [2018-11-10 04:01:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2018-11-10 04:01:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2018-11-10 04:01:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2018-11-10 04:01:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2018-11-10 04:01:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2018-11-10 04:01:57,372 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2018-11-10 04:01:57,372 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_init [2018-11-10 04:01:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_init [2018-11-10 04:01:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_1 [2018-11-10 04:01:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_1 [2018-11-10 04:01:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2018-11-10 04:01:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2018-11-10 04:01:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-10 04:01:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-10 04:01:57,373 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-10 04:01:57,373 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-10 04:01:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2018-11-10 04:01:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2018-11-10 04:01:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2018-11-10 04:01:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2018-11-10 04:01:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2018-11-10 04:01:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2018-11-10 04:01:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2018-11-10 04:01:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2018-11-10 04:01:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmalloc_12 [2018-11-10 04:01:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmalloc_12 [2018-11-10 04:01:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-11-10 04:01:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-11-10 04:01:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:01:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:01:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2018-11-10 04:01:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2018-11-10 04:02:01,198 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:02:01,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:02:01 BoogieIcfgContainer [2018-11-10 04:02:01,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:02:01,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:02:01,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:02:01,202 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:02:01,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:01:56" (1/3) ... [2018-11-10 04:02:01,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e18d1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:02:01, skipping insertion in model container [2018-11-10 04:02:01,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:01:57" (2/3) ... [2018-11-10 04:02:01,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e18d1f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:02:01, skipping insertion in model container [2018-11-10 04:02:01,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:02:01" (3/3) ... [2018-11-10 04:02:01,204 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point_true-unreach-call.cil.out.c [2018-11-10 04:02:01,210 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:02:01,216 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:02:01,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:02:01,249 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:02:01,249 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:02:01,249 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:02:01,249 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:02:01,249 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:02:01,250 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:02:01,250 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:02:01,250 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:02:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states. [2018-11-10 04:02:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 04:02:01,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:01,276 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:01,278 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:01,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:01,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1357926532, now seen corresponding path program 1 times [2018-11-10 04:02:01,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:01,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:01,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:01,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:01,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:01,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:01,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:01,590 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:01,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:01,604 INFO L87 Difference]: Start difference. First operand 344 states. Second operand 3 states. [2018-11-10 04:02:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:03,744 INFO L93 Difference]: Finished difference Result 904 states and 1247 transitions. [2018-11-10 04:02:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:03,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 04:02:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:03,758 INFO L225 Difference]: With dead ends: 904 [2018-11-10 04:02:03,758 INFO L226 Difference]: Without dead ends: 504 [2018-11-10 04:02:03,763 INFO L605 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 [2018-11-10 04:02:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-11-10 04:02:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2018-11-10 04:02:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-11-10 04:02:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 680 transitions. [2018-11-10 04:02:03,830 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 680 transitions. Word has length 44 [2018-11-10 04:02:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:03,830 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 680 transitions. [2018-11-10 04:02:03,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 680 transitions. [2018-11-10 04:02:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 04:02:03,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:03,835 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:03,835 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:03,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1794029841, now seen corresponding path program 1 times [2018-11-10 04:02:03,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:03,838 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:03,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:03,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:03,965 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:03,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:03,967 INFO L87 Difference]: Start difference. First operand 501 states and 680 transitions. Second operand 3 states. [2018-11-10 04:02:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:03,999 INFO L93 Difference]: Finished difference Result 980 states and 1335 transitions. [2018-11-10 04:02:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:03,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-10 04:02:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:04,003 INFO L225 Difference]: With dead ends: 980 [2018-11-10 04:02:04,003 INFO L226 Difference]: Without dead ends: 501 [2018-11-10 04:02:04,005 INFO L605 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 [2018-11-10 04:02:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-10 04:02:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2018-11-10 04:02:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-11-10 04:02:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 679 transitions. [2018-11-10 04:02:04,032 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 679 transitions. Word has length 51 [2018-11-10 04:02:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:04,032 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 679 transitions. [2018-11-10 04:02:04,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 679 transitions. [2018-11-10 04:02:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-10 04:02:04,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:04,034 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:04,035 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:04,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash 846540979, now seen corresponding path program 1 times [2018-11-10 04:02:04,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:04,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:04,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:04,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:04,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:04,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:04,186 INFO L87 Difference]: Start difference. First operand 501 states and 679 transitions. Second operand 3 states. [2018-11-10 04:02:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:04,232 INFO L93 Difference]: Finished difference Result 902 states and 1274 transitions. [2018-11-10 04:02:04,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:04,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-10 04:02:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:04,238 INFO L225 Difference]: With dead ends: 902 [2018-11-10 04:02:04,238 INFO L226 Difference]: Without dead ends: 885 [2018-11-10 04:02:04,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-11-10 04:02:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 843. [2018-11-10 04:02:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-11-10 04:02:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1184 transitions. [2018-11-10 04:02:04,282 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1184 transitions. Word has length 54 [2018-11-10 04:02:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:04,282 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1184 transitions. [2018-11-10 04:02:04,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1184 transitions. [2018-11-10 04:02:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 04:02:04,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:04,285 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:04,285 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:04,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:04,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1712324290, now seen corresponding path program 1 times [2018-11-10 04:02:04,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:04,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:04,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:04,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:04,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:04,379 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:04,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:04,380 INFO L87 Difference]: Start difference. First operand 843 states and 1184 transitions. Second operand 3 states. [2018-11-10 04:02:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:04,500 INFO L93 Difference]: Finished difference Result 2376 states and 3329 transitions. [2018-11-10 04:02:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:04,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-10 04:02:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:04,507 INFO L225 Difference]: With dead ends: 2376 [2018-11-10 04:02:04,507 INFO L226 Difference]: Without dead ends: 1555 [2018-11-10 04:02:04,510 INFO L605 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 [2018-11-10 04:02:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-11-10 04:02:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1538. [2018-11-10 04:02:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-10 04:02:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2149 transitions. [2018-11-10 04:02:04,576 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2149 transitions. Word has length 69 [2018-11-10 04:02:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:04,577 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 2149 transitions. [2018-11-10 04:02:04,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2149 transitions. [2018-11-10 04:02:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 04:02:04,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:04,581 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:04,582 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:04,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash -798798622, now seen corresponding path program 1 times [2018-11-10 04:02:04,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:04,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:04,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 04:02:04,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:04,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:04,681 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:04,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:04,681 INFO L87 Difference]: Start difference. First operand 1538 states and 2149 transitions. Second operand 3 states. [2018-11-10 04:02:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:04,751 INFO L93 Difference]: Finished difference Result 3066 states and 4292 transitions. [2018-11-10 04:02:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:04,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-11-10 04:02:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:04,761 INFO L225 Difference]: With dead ends: 3066 [2018-11-10 04:02:04,761 INFO L226 Difference]: Without dead ends: 1550 [2018-11-10 04:02:04,764 INFO L605 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 [2018-11-10 04:02:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2018-11-10 04:02:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1546. [2018-11-10 04:02:04,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 04:02:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2157 transitions. [2018-11-10 04:02:04,834 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2157 transitions. Word has length 75 [2018-11-10 04:02:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:04,834 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 2157 transitions. [2018-11-10 04:02:04,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2157 transitions. [2018-11-10 04:02:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-10 04:02:04,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:04,838 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:04,838 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:04,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash -550652128, now seen corresponding path program 1 times [2018-11-10 04:02:04,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:04,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:04,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:04,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:04,917 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:04,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:04,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:04,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:04,918 INFO L87 Difference]: Start difference. First operand 1546 states and 2157 transitions. Second operand 3 states. [2018-11-10 04:02:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:07,106 INFO L93 Difference]: Finished difference Result 3853 states and 5392 transitions. [2018-11-10 04:02:07,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:07,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-11-10 04:02:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:07,115 INFO L225 Difference]: With dead ends: 3853 [2018-11-10 04:02:07,116 INFO L226 Difference]: Without dead ends: 2329 [2018-11-10 04:02:07,119 INFO L605 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 [2018-11-10 04:02:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2018-11-10 04:02:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2310. [2018-11-10 04:02:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2310 states. [2018-11-10 04:02:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3211 transitions. [2018-11-10 04:02:07,212 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3211 transitions. Word has length 75 [2018-11-10 04:02:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:07,212 INFO L481 AbstractCegarLoop]: Abstraction has 2310 states and 3211 transitions. [2018-11-10 04:02:07,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3211 transitions. [2018-11-10 04:02:07,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 04:02:07,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:07,216 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:07,216 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:07,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1494157276, now seen corresponding path program 1 times [2018-11-10 04:02:07,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:07,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:07,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:07,218 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:07,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:07,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:07,282 INFO L87 Difference]: Start difference. First operand 2310 states and 3211 transitions. Second operand 3 states. [2018-11-10 04:02:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:07,453 INFO L93 Difference]: Finished difference Result 6476 states and 8982 transitions. [2018-11-10 04:02:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:07,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-10 04:02:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:07,469 INFO L225 Difference]: With dead ends: 6476 [2018-11-10 04:02:07,469 INFO L226 Difference]: Without dead ends: 4188 [2018-11-10 04:02:07,475 INFO L605 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 [2018-11-10 04:02:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2018-11-10 04:02:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4171. [2018-11-10 04:02:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2018-11-10 04:02:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 5767 transitions. [2018-11-10 04:02:07,631 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 5767 transitions. Word has length 79 [2018-11-10 04:02:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:07,631 INFO L481 AbstractCegarLoop]: Abstraction has 4171 states and 5767 transitions. [2018-11-10 04:02:07,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5767 transitions. [2018-11-10 04:02:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:02:07,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:07,636 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:07,637 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:07,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash -173778434, now seen corresponding path program 1 times [2018-11-10 04:02:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:07,638 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 04:02:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:02:07,736 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:07,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:02:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:02:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:02:07,738 INFO L87 Difference]: Start difference. First operand 4171 states and 5767 transitions. Second operand 3 states. [2018-11-10 04:02:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:10,000 INFO L93 Difference]: Finished difference Result 10432 states and 14473 transitions. [2018-11-10 04:02:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:10,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-10 04:02:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:10,022 INFO L225 Difference]: With dead ends: 10432 [2018-11-10 04:02:10,023 INFO L226 Difference]: Without dead ends: 6283 [2018-11-10 04:02:10,032 INFO L605 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 [2018-11-10 04:02:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2018-11-10 04:02:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 6260. [2018-11-10 04:02:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2018-11-10 04:02:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 8618 transitions. [2018-11-10 04:02:10,249 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 8618 transitions. Word has length 85 [2018-11-10 04:02:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:10,249 INFO L481 AbstractCegarLoop]: Abstraction has 6260 states and 8618 transitions. [2018-11-10 04:02:10,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:02:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 8618 transitions. [2018-11-10 04:02:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 04:02:10,255 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:10,255 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-11-10 04:02:10,255 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:10,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:10,255 INFO L82 PathProgramCache]: Analyzing trace with hash -873447795, now seen corresponding path program 1 times [2018-11-10 04:02:10,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:10,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:10,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:02:10,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:10,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:02:10,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:10,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:02:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:02:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:02:10,357 INFO L87 Difference]: Start difference. First operand 6260 states and 8618 transitions. Second operand 5 states. [2018-11-10 04:02:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:12,550 INFO L93 Difference]: Finished difference Result 12588 states and 17318 transitions. [2018-11-10 04:02:12,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:02:12,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-11-10 04:02:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:12,571 INFO L225 Difference]: With dead ends: 12588 [2018-11-10 04:02:12,571 INFO L226 Difference]: Without dead ends: 6206 [2018-11-10 04:02:12,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:02:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2018-11-10 04:02:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 6188. [2018-11-10 04:02:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6188 states. [2018-11-10 04:02:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6188 states to 6188 states and 8492 transitions. [2018-11-10 04:02:12,768 INFO L78 Accepts]: Start accepts. Automaton has 6188 states and 8492 transitions. Word has length 84 [2018-11-10 04:02:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:12,768 INFO L481 AbstractCegarLoop]: Abstraction has 6188 states and 8492 transitions. [2018-11-10 04:02:12,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:02:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6188 states and 8492 transitions. [2018-11-10 04:02:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:02:12,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:12,773 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:12,773 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:12,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash 309551799, now seen corresponding path program 1 times [2018-11-10 04:02:12,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:12,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:12,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:12,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:02:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 04:02:12,914 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:12,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 04:02:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 04:02:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 04:02:12,914 INFO L87 Difference]: Start difference. First operand 6188 states and 8492 transitions. Second operand 6 states. [2018-11-10 04:02:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:15,104 INFO L93 Difference]: Finished difference Result 12498 states and 17147 transitions. [2018-11-10 04:02:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 04:02:15,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-11-10 04:02:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:15,122 INFO L225 Difference]: With dead ends: 12498 [2018-11-10 04:02:15,122 INFO L226 Difference]: Without dead ends: 6170 [2018-11-10 04:02:15,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2018-11-10 04:02:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 6170. [2018-11-10 04:02:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2018-11-10 04:02:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 8438 transitions. [2018-11-10 04:02:15,244 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 8438 transitions. Word has length 139 [2018-11-10 04:02:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:15,245 INFO L481 AbstractCegarLoop]: Abstraction has 6170 states and 8438 transitions. [2018-11-10 04:02:15,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 04:02:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 8438 transitions. [2018-11-10 04:02:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 04:02:15,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:15,249 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:15,249 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:15,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash -529982290, now seen corresponding path program 1 times [2018-11-10 04:02:15,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:15,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:15,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:15,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:15,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:02:15,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:15,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:02:15,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:15,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:02:15,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:02:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:15,335 INFO L87 Difference]: Start difference. First operand 6170 states and 8438 transitions. Second operand 4 states. [2018-11-10 04:02:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:17,612 INFO L93 Difference]: Finished difference Result 12300 states and 16841 transitions. [2018-11-10 04:02:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:02:17,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-11-10 04:02:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:17,631 INFO L225 Difference]: With dead ends: 12300 [2018-11-10 04:02:17,631 INFO L226 Difference]: Without dead ends: 6152 [2018-11-10 04:02:17,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:02:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2018-11-10 04:02:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 6152. [2018-11-10 04:02:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2018-11-10 04:02:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 8384 transitions. [2018-11-10 04:02:17,813 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 8384 transitions. Word has length 140 [2018-11-10 04:02:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:17,813 INFO L481 AbstractCegarLoop]: Abstraction has 6152 states and 8384 transitions. [2018-11-10 04:02:17,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:02:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 8384 transitions. [2018-11-10 04:02:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:02:17,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:02:17,818 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:02:17,818 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:02:17,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:02:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 46846313, now seen corresponding path program 1 times [2018-11-10 04:02:17,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:02:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:02:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:02:17,820 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:02:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:02:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:02:17,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:02:17,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:02:17,961 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:02:17,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 04:02:17,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:02:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:02:17,962 INFO L87 Difference]: Start difference. First operand 6152 states and 8384 transitions. Second operand 5 states. [2018-11-10 04:02:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:02:18,079 INFO L93 Difference]: Finished difference Result 6341 states and 8624 transitions. [2018-11-10 04:02:18,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:02:18,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2018-11-10 04:02:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:02:18,080 INFO L225 Difference]: With dead ends: 6341 [2018-11-10 04:02:18,081 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 04:02:18,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:02:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 04:02:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 04:02:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 04:02:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:02:18,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2018-11-10 04:02:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:02:18,094 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:02:18,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 04:02:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:02:18,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 04:02:18,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 04:02:20,660 INFO L428 ceAbstractionStarter]: At program point ldv_spin_unlock_5ENTRY(lines 1918 1926) the Hoare annotation is: true [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point ldv_spin_unlock_5EXIT(lines 1918 1926) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point ldv_spin_unlock_5FINAL(lines 1918 1926) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L428 ceAbstractionStarter]: At program point ldv_spin_lock_1ENTRY(lines 1908 1916) the Hoare annotation is: true [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point ldv_spin_lock_1FINAL(lines 1908 1916) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point ldv_spin_lock_1EXIT(lines 1908 1916) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point atomic_incEXIT(lines 1896 1904) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L428 ceAbstractionStarter]: At program point atomic_incENTRY(lines 1896 1904) the Hoare annotation is: true [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point atomic_incFINAL(lines 1896 1904) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point torture_lock_busted_write_delayEXIT(lines 2115 2144) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L428 ceAbstractionStarter]: At program point torture_lock_busted_write_delayENTRY(lines 2115 2144) the Hoare annotation is: true [2018-11-10 04:02:20,660 INFO L428 ceAbstractionStarter]: At program point L2134(lines 2125 2139) the Hoare annotation is: true [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point L2133(lines 2133 2137) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L428 ceAbstractionStarter]: At program point L2130(lines 2125 2139) the Hoare annotation is: true [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point L2125(lines 2125 2141) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point L2125-2(lines 2115 2144) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point torture_lock_spin_write_unlock_irqEXIT(lines 2226 2234) no Hoare annotation was computed. [2018-11-10 04:02:20,660 INFO L425 ceAbstractionStarter]: For program point L2231-1(line 2231) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L428 ceAbstractionStarter]: At program point L2231(line 2231) the Hoare annotation is: true [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point torture_lock_spin_write_unlock_irqFINAL(lines 2226 2234) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L428 ceAbstractionStarter]: At program point torture_lock_spin_write_unlock_irqENTRY(lines 2226 2234) the Hoare annotation is: true [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2909(line 2909) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2843(line 2843) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 2693 2972) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2794(lines 2794 2800) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2728(lines 2728 2733) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2910(lines 2910 2915) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2844(lines 2844 2849) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2910-2(lines 2900 2957) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2844-2(lines 2834 2891) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L421 ceAbstractionStarter]: At program point L2712(line 2712) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2712-1(line 2712) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2795-1(line 2795) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L421 ceAbstractionStarter]: At program point L2795(line 2795) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (= 0 ~ldv_spin~0) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2729-1(line 2729) no Hoare annotation was computed. [2018-11-10 04:02:20,661 INFO L421 ceAbstractionStarter]: At program point L2729(line 2729) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,661 INFO L425 ceAbstractionStarter]: For program point L2911-1(line 2911) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L421 ceAbstractionStarter]: At program point L2911(line 2911) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2845-1(line 2845) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L421 ceAbstractionStarter]: At program point L2845(line 2845) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 2693 2972) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2763(line 2763) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2764(lines 2764 2770) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2946(line 2946) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2880(line 2880) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2781(line 2781) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2963(line 2963) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2897(line 2897) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2831(line 2831) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2947(lines 2947 2953) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2881(lines 2881 2887) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L428 ceAbstractionStarter]: At program point L2782(line 2782) the Hoare annotation is: true [2018-11-10 04:02:20,662 INFO L428 ceAbstractionStarter]: At program point L2815(lines 2707 2971) the Hoare annotation is: true [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2749(line 2749) no Hoare annotation was computed. [2018-11-10 04:02:20,662 INFO L428 ceAbstractionStarter]: At program point L2964(line 2964) the Hoare annotation is: true [2018-11-10 04:02:20,662 INFO L425 ceAbstractionStarter]: For program point L2898(lines 2898 2961) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2931-1(line 2931) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L421 ceAbstractionStarter]: At program point L2931(line 2931) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2832(lines 2832 2895) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2865-1(line 2865) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L421 ceAbstractionStarter]: At program point L2865(line 2865) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2750(lines 2750 2755) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2750-2(lines 2726 2783) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2751-1(line 2751) no Hoare annotation was computed. [2018-11-10 04:02:20,663 INFO L421 ceAbstractionStarter]: At program point L2751(line 2751) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,663 INFO L421 ceAbstractionStarter]: At program point L2966(lines 2707 2971) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,663 INFO L425 ceAbstractionStarter]: For program point L2900(lines 2900 2957) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2834(lines 2834 2891) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2735(line 2735) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2917-1(line 2917) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L421 ceAbstractionStarter]: At program point L2917(line 2917) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2851-1(line 2851) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L421 ceAbstractionStarter]: At program point L2851(line 2851) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2901(line 2901) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2802(line 2802) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2835(line 2835) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2736(lines 2736 2741) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2736-2(lines 2726 2783) no Hoare annotation was computed. [2018-11-10 04:02:20,664 INFO L425 ceAbstractionStarter]: For program point L2902(lines 2902 2907) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2836(lines 2836 2841) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2803(lines 2803 2821) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2737-1(line 2737) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L421 ceAbstractionStarter]: At program point L2737(line 2737) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2903-1(line 2903) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L421 ceAbstractionStarter]: At program point L2903(line 2903) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,665 INFO L421 ceAbstractionStarter]: At program point L2804(line 2804) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2837-1(line 2837) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L421 ceAbstractionStarter]: At program point L2837(line 2837) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2804-1(line 2804) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2722(lines 2722 2965) no Hoare annotation was computed. [2018-11-10 04:02:20,665 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 2693 2972) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,665 INFO L425 ceAbstractionStarter]: For program point L2937(line 2937) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2871(line 2871) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2772(line 2772) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2805(lines 2805 2812) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2805-2(lines 2803 2819) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2789(line 2789) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2723(line 2723) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2938(lines 2938 2944) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2872(lines 2872 2878) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2773(lines 2773 2779) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2955(line 2955) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2889(line 2889) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2790(lines 2790 2829) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2823(line 2823) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2724(lines 2724 2787) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2757-1(line 2757) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L421 ceAbstractionStarter]: At program point L2757(line 2757) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,666 INFO L421 ceAbstractionStarter]: At program point L2708(line 2708) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2708-1(line 2708) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L428 ceAbstractionStarter]: At program point L2956(line 2956) the Hoare annotation is: true [2018-11-10 04:02:20,666 INFO L428 ceAbstractionStarter]: At program point L2890(line 2890) the Hoare annotation is: true [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2923(line 2923) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L428 ceAbstractionStarter]: At program point L2824(line 2824) the Hoare annotation is: true [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2857(line 2857) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2924(lines 2924 2929) no Hoare annotation was computed. [2018-11-10 04:02:20,666 INFO L425 ceAbstractionStarter]: For program point L2858(lines 2858 2863) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2924-2(lines 2900 2957) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2792(lines 2792 2825) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2858-2(lines 2834 2891) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2726(lines 2726 2783) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L421 ceAbstractionStarter]: At program point L2710(line 2710) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2743-1(line 2743) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L421 ceAbstractionStarter]: At program point L2743(line 2743) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2710-1(line 2710) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2925-1(line 2925) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L421 ceAbstractionStarter]: At program point L2925(line 2925) the Hoare annotation is: (or (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2859-1(line 2859) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L421 ceAbstractionStarter]: At program point L2859(line 2859) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= 1 ~ldv_state_variable_0~0)) (not (= 0 |old(~ldv_state_variable_2~0)|)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 0 ~onoff_interval~0)) (not (= 0 |old(~ldv_state_variable_1~0)|))) [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2793(line 2793) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2727(line 2727) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L428 ceAbstractionStarter]: At program point __kmallocENTRY(lines 1940 1943) the Hoare annotation is: true [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point __kmallocFINAL(lines 1940 1943) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point __kmallocEXIT(lines 1940 1943) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L428 ceAbstractionStarter]: At program point L1942(line 1942) the Hoare annotation is: true [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L1942-1(line 1942) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2366(lines 2366 2370) no Hoare annotation was computed. [2018-11-10 04:02:20,667 INFO L425 ceAbstractionStarter]: For program point L2337-2(lines 2337 2341) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2366-1(lines 2319 2373) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2364-1(line 2364) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L428 ceAbstractionStarter]: At program point L2356(lines 2329 2372) the Hoare annotation is: true [2018-11-10 04:02:20,668 INFO L428 ceAbstractionStarter]: At program point L2354(lines 2329 2372) the Hoare annotation is: true [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2348(lines 2348 2352) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2348-2(lines 2348 2352) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L428 ceAbstractionStarter]: At program point L2367(line 2367) the Hoare annotation is: true [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2363(line 2363) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2363-2(lines 2362 2364) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point lock_torture_printkEXIT(lines 2319 2373) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L428 ceAbstractionStarter]: At program point lock_torture_printkENTRY(lines 2319 2373) the Hoare annotation is: true [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2343(lines 2343 2347) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point L2343-2(lines 2343 2347) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 2027 2035) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L428 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 2027 2035) the Hoare annotation is: true [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2033) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 2027 2035) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point torture_lock_busted_write_lockFINAL(lines 2107 2114) no Hoare annotation was computed. [2018-11-10 04:02:20,668 INFO L428 ceAbstractionStarter]: At program point torture_lock_busted_write_lockENTRY(lines 2107 2114) the Hoare annotation is: true [2018-11-10 04:02:20,668 INFO L425 ceAbstractionStarter]: For program point torture_lock_busted_write_lockEXIT(lines 2107 2114) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point kzallocEXIT(lines 3023 3031) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point kzallocENTRY(lines 3023 3031) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point L3028(line 3028) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point kzallocFINAL(lines 3023 3031) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point L3028-1(line 3028) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point bitmap_weightFINAL(lines 1868 1876) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point bitmap_weightEXIT(lines 1868 1876) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point bitmap_weightENTRY(lines 1868 1876) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point kmallocENTRY(lines 3003 3012) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point L3008(line 3008) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point L3009(line 3009) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point L3008-1(line 3008) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point kmallocFINAL(lines 3003 3012) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point kmallocEXIT(lines 3003 3012) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 2036 2044) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 2036 2044) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 2036 2044) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point L2384(lines 2384 2389) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L425 ceAbstractionStarter]: For program point lock_torture_stats_printEXIT(lines 2374 2395) no Hoare annotation was computed. [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point L2382(line 2382) the Hoare annotation is: true [2018-11-10 04:02:20,669 INFO L428 ceAbstractionStarter]: At program point lock_torture_stats_printENTRY(lines 2374 2395) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point L2382-1(line 2382) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point lock_torture_stats_printFINAL(lines 2374 2395) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point L2390(line 2390) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point L2390-1(line 2390) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point torture_lock_busted_write_unlockFINAL(lines 2145 2152) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point torture_lock_busted_write_unlockEXIT(lines 2145 2152) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point cpumask_weightEXIT(lines 1879 1887) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point L1884(line 1884) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point L1884-1(line 1884) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point cpumask_weightENTRY(lines 1879 1887) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point cpumask_weightFINAL(lines 1879 1887) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point spin_lockENTRY(lines 2973 2982) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point L2978-1(line 2978) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point spin_lockFINAL(lines 2973 2982) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point spin_lockEXIT(lines 2973 2982) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point L2978(line 2978) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point lock_torture_print_module_parmsEXIT(lines 2426 2437) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point lock_torture_print_module_parmsENTRY(lines 2426 2437) the Hoare annotation is: true [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point lock_torture_print_module_parmsFINAL(lines 2426 2437) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point atomic_readFINAL(lines 1888 1895) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L425 ceAbstractionStarter]: For program point atomic_readEXIT(lines 1888 1895) no Hoare annotation was computed. [2018-11-10 04:02:20,670 INFO L428 ceAbstractionStarter]: At program point atomic_readENTRY(lines 1888 1895) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point ldv_spin_unlock_irqrestore_8ENTRY(lines 1928 1936) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point ldv_spin_unlock_irqrestore_8EXIT(lines 1928 1936) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point ldv_spin_unlock_irqrestore_8FINAL(lines 1928 1936) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2179-2(lines 2179 2195) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2197(lines 2197 2201) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2197-2(lines 2166 2204) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_delayEXIT(lines 2166 2204) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point L2188(lines 2179 2193) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2187(lines 2187 2191) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point L2184(lines 2179 2193) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point torture_spin_lock_write_delayENTRY(lines 2166 2204) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2179(lines 2179 2195) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2447(lines 2447 2451) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2476(lines 2476 2480) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point L2472(lines 2472 2481) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point L2470(line 2470) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L425 ceAbstractionStarter]: For program point lock_torture_cleanupEXIT(lines 2438 2484) no Hoare annotation was computed. [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point lock_torture_cleanupENTRY(lines 2438 2484) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point L2470-1(line 2470) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point L2460(lines 2452 2466) the Hoare annotation is: true [2018-11-10 04:02:20,671 INFO L428 ceAbstractionStarter]: At program point L2458(lines 2452 2466) the Hoare annotation is: true [2018-11-10 04:02:20,672 INFO L425 ceAbstractionStarter]: For program point L2452(lines 2452 2468) no Hoare annotation was computed. [2018-11-10 04:02:20,672 INFO L425 ceAbstractionStarter]: For program point L2452-2(lines 2452 2468) no Hoare annotation was computed. [2018-11-10 04:02:20,672 INFO L425 ceAbstractionStarter]: For program point L2479-1(lines 2438 2484) no Hoare annotation was computed. [2018-11-10 04:02:20,672 INFO L428 ceAbstractionStarter]: At program point L2479(line 2479) the Hoare annotation is: true [2018-11-10 04:02:20,672 INFO L428 ceAbstractionStarter]: At program point L2477(line 2477) the Hoare annotation is: true [2018-11-10 04:02:20,672 INFO L428 ceAbstractionStarter]: At program point L2473(line 2473) the Hoare annotation is: true [2018-11-10 04:02:20,672 INFO L425 ceAbstractionStarter]: For program point L2471(line 2471) no Hoare annotation was computed. [2018-11-10 04:02:20,672 INFO L428 ceAbstractionStarter]: At program point L2988(line 2988) the Hoare annotation is: true [2018-11-10 04:02:20,672 INFO L428 ceAbstractionStarter]: At program point spin_unlockENTRY(lines 2983 2992) the Hoare annotation is: true [2018-11-10 04:02:20,672 INFO L425 ceAbstractionStarter]: For program point spin_unlockFINAL(lines 2983 2992) no Hoare annotation was computed. [2018-11-10 04:02:20,672 INFO L421 ceAbstractionStarter]: At program point L2988-1(line 2988) the Hoare annotation is: (or (= 0 ~ldv_spin~0) (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 ~lwsa~0.offset)) (not (= ~lwsa~0.base 0)) (or (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0))) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,672 INFO L425 ceAbstractionStarter]: For program point spin_unlockEXIT(lines 2983 2992) no Hoare annotation was computed. [2018-11-10 04:02:20,672 INFO L428 ceAbstractionStarter]: At program point ldv_spin_unlockENTRY(lines 3084 3092) the Hoare annotation is: true [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point ldv_spin_unlockFINAL(lines 3084 3092) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point ldv_spin_unlockEXIT(lines 3084 3092) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point ldv_spin_lockEXIT(lines 3075 3083) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L428 ceAbstractionStarter]: At program point ldv_spin_lockENTRY(lines 3075 3083) the Hoare annotation is: true [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point ldv_spin_lockFINAL(lines 3075 3083) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point L2221-1(line 2221) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L428 ceAbstractionStarter]: At program point L2221(line 2221) the Hoare annotation is: true [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_lock_irqEXIT(lines 2216 2225) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L428 ceAbstractionStarter]: At program point torture_spin_lock_write_lock_irqENTRY(lines 2216 2225) the Hoare annotation is: true [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_lock_irqFINAL(lines 2216 2225) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L428 ceAbstractionStarter]: At program point L1951(line 1951) the Hoare annotation is: true [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point L1951-1(line 1951) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L425 ceAbstractionStarter]: For program point ldv_kmalloc_12EXIT(lines 1946 1954) no Hoare annotation was computed. [2018-11-10 04:02:20,673 INFO L428 ceAbstractionStarter]: At program point ldv_kmalloc_12ENTRY(lines 1946 1954) the Hoare annotation is: true [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point ldv_kmalloc_12FINAL(lines 1946 1954) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L428 ceAbstractionStarter]: At program point spin_unlock_irqrestoreENTRY(lines 2993 3002) the Hoare annotation is: true [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point spin_unlock_irqrestoreEXIT(lines 2993 3002) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L428 ceAbstractionStarter]: At program point L2998(line 2998) the Hoare annotation is: true [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point spin_unlock_irqrestoreFINAL(lines 2993 3002) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L421 ceAbstractionStarter]: At program point L2998-1(line 2998) the Hoare annotation is: (or (= 0 ~ldv_spin~0) (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 ~lwsa~0.offset)) (not (= ~lwsa~0.base 0)) (or (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0))) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,674 INFO L428 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1964 1981) the Hoare annotation is: true [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1964 1981) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point L1972(lines 1972 1979) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1964 1981) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,674 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:02:20,674 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,675 INFO L421 ceAbstractionStarter]: At program point L2620-1(lines 2620 2629) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,675 INFO L425 ceAbstractionStarter]: For program point L2612(lines 2612 2616) no Hoare annotation was computed. [2018-11-10 04:02:20,675 INFO L421 ceAbstractionStarter]: At program point L2530(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,675 INFO L421 ceAbstractionStarter]: At program point L2539(lines 2531 2548) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (and (= 0 ~ldv_spin~0) (= lock_torture_init_~tmp___0~9 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,675 INFO L425 ceAbstractionStarter]: For program point L2630(line 2630) no Hoare annotation was computed. [2018-11-10 04:02:20,675 INFO L425 ceAbstractionStarter]: For program point L2663(lines 2663 2675) no Hoare annotation was computed. [2018-11-10 04:02:20,675 INFO L421 ceAbstractionStarter]: At program point L2564(line 2564) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,675 INFO L425 ceAbstractionStarter]: For program point L2663-2(lines 2663 2675) no Hoare annotation was computed. [2018-11-10 04:02:20,675 INFO L425 ceAbstractionStarter]: For program point L2564-1(line 2564) no Hoare annotation was computed. [2018-11-10 04:02:20,675 INFO L425 ceAbstractionStarter]: For program point L2622(lines 2622 2626) no Hoare annotation was computed. [2018-11-10 04:02:20,676 INFO L421 ceAbstractionStarter]: At program point L2556-1(lines 2556 2561) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,676 INFO L421 ceAbstractionStarter]: At program point L2680(line 2680) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (and (<= (+ lock_torture_init_~firsterr~0 12) 0) (= 0 ~ldv_spin~0) (= lock_torture_init_~tmp___0~9 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,676 INFO L425 ceAbstractionStarter]: For program point L2680-1(line 2680) no Hoare annotation was computed. [2018-11-10 04:02:20,676 INFO L421 ceAbstractionStarter]: At program point L2656(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,676 INFO L425 ceAbstractionStarter]: For program point L2590(lines 2590 2599) no Hoare annotation was computed. [2018-11-10 04:02:20,676 INFO L421 ceAbstractionStarter]: At program point L2524(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,676 INFO L425 ceAbstractionStarter]: For program point L2590-2(lines 2497 2682) no Hoare annotation was computed. [2018-11-10 04:02:20,676 INFO L425 ceAbstractionStarter]: For program point lock_torture_initFINAL(lines 2485 2683) no Hoare annotation was computed. [2018-11-10 04:02:20,676 INFO L421 ceAbstractionStarter]: At program point L2541(lines 2531 2548) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (and (= 0 ~ldv_spin~0) (= lock_torture_init_~tmp___0~9 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,676 INFO L421 ceAbstractionStarter]: At program point lock_torture_initENTRY(lines 2485 2683) the Hoare annotation is: (or (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0)) (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2632(lines 2632 2642) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2566(lines 2566 2576) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point lock_torture_initEXIT(lines 2485 2683) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L421 ceAbstractionStarter]: At program point L2583(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2633(lines 2633 2637) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2567(lines 2567 2571) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2600-1(lines 2497 2682) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2633-2(lines 2633 2637) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2567-2(lines 2567 2571) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L421 ceAbstractionStarter]: At program point L2658(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2592(lines 2592 2596) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L421 ceAbstractionStarter]: At program point L2526(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2559-1(line 2559) no Hoare annotation was computed. [2018-11-10 04:02:20,677 INFO L421 ceAbstractionStarter]: At program point L2559(line 2559) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,677 INFO L425 ceAbstractionStarter]: For program point L2650(lines 2650 2654) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2518(lines 2518 2522) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2551(lines 2551 2555) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2551-2(lines 2497 2682) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L421 ceAbstractionStarter]: At program point L2552(line 2552) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (and (= ~lwsa~0.offset 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= lock_torture_init_~tmp___0~9 0)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,678 INFO L421 ceAbstractionStarter]: At program point L2585(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2552-1(line 2552) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2610-1(lines 2497 2682) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2668(lines 2668 2672) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2602(lines 2602 2606) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2503(lines 2503 2507) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2503-2(lines 2497 2682) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L421 ceAbstractionStarter]: At program point L2669(lines 2497 2682) the Hoare annotation is: (or (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 |old(~lwsa~0.offset)|)) (not (= |old(~ldv_spin~0)| 0)) (not (= |old(~lwsa~0.base)| 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (and (<= (+ lock_torture_init_~firsterr~0 12) 0) (= 0 ~ldv_spin~0) (= lock_torture_init_~tmp___0~9 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2562(line 2562) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_lockFINAL(lines 2157 2165) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L428 ceAbstractionStarter]: At program point torture_spin_lock_write_lockENTRY(lines 2157 2165) the Hoare annotation is: true [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_lockEXIT(lines 2157 2165) no Hoare annotation was computed. [2018-11-10 04:02:20,678 INFO L425 ceAbstractionStarter]: For program point L2162(line 2162) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (or (= 0 ~ldv_spin~0) (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 ~lwsa~0.offset)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~lwsa~0.base 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point ##fun~~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L428 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L421 ceAbstractionStarter]: At program point ##fun~~TO~VOIDENTRY(line -1) the Hoare annotation is: (or (= 0 ~ldv_spin~0) (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 ~lwsa~0.offset)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~lwsa~0.base 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,679 INFO L428 ceAbstractionStarter]: At program point L-1-6(line -1) the Hoare annotation is: true [2018-11-10 04:02:20,679 INFO L421 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (or (= 0 ~ldv_spin~0) (not (= 0 ~ldv_state_variable_2~0)) (not (= 0 ~lwsa~0.offset)) (not (= |old(~ldv_spin~0)| 0)) (not (= ~lwsa~0.base 0)) (not (= (+ ~nwriters_stress~0 1) 0)) (not (= 1 ~ldv_state_variable_0~0)) (not (= 0 ~onoff_interval~0)) (not (= 0 ~ldv_state_variable_1~0))) [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L428 ceAbstractionStarter]: At program point L1993(line 1993) the Hoare annotation is: true [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point L1993-1(line 1993) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1982 1999) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point L1990(lines 1990 1997) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L428 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1982 1999) the Hoare annotation is: true [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1982 1999) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~lwsa~0.offset 0) (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_1~0 0) (= ~onoff_interval~0 0) (= 0 ~ldv_spin~0) (= ~lwsa~0.base 0) (= (+ ~nwriters_stress~0 1) 0)) [2018-11-10 04:02:20,679 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 04:02:20,679 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_unlockEXIT(lines 2205 2213) no Hoare annotation was computed. [2018-11-10 04:02:20,680 INFO L428 ceAbstractionStarter]: At program point torture_spin_lock_write_unlockENTRY(lines 2205 2213) the Hoare annotation is: true [2018-11-10 04:02:20,680 INFO L425 ceAbstractionStarter]: For program point torture_spin_lock_write_unlockFINAL(lines 2205 2213) no Hoare annotation was computed. [2018-11-10 04:02:20,680 INFO L425 ceAbstractionStarter]: For program point L3042-1(lines 3034 3046) no Hoare annotation was computed. [2018-11-10 04:02:20,680 INFO L425 ceAbstractionStarter]: For program point L3039(lines 3039 3043) no Hoare annotation was computed. [2018-11-10 04:02:20,680 INFO L425 ceAbstractionStarter]: For program point ldv_check_alloc_flagsEXIT(lines 3034 3046) no Hoare annotation was computed. [2018-11-10 04:02:20,680 INFO L428 ceAbstractionStarter]: At program point ldv_check_alloc_flagsENTRY(lines 3034 3046) the Hoare annotation is: true [2018-11-10 04:02:20,680 INFO L421 ceAbstractionStarter]: At program point L3042(line 3042) the Hoare annotation is: (or (not (= ~ldv_spin~0 0)) (not (= (+ ~nwriters_stress~0 1) 0))) [2018-11-10 04:02:20,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:02:20 BoogieIcfgContainer [2018-11-10 04:02:20,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:02:20,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:02:20,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:02:20,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:02:20,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:02:01" (3/4) ... [2018-11-10 04:02:20,714 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 04:02:20,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock_5 [2018-11-10 04:02:20,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock_1 [2018-11-10 04:02:20,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure atomic_inc [2018-11-10 04:02:20,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_delay [2018-11-10 04:02:20,722 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_spin_write_unlock_irq [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __kmalloc [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_printk [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_lock [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure bitmap_weight [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_stats_print [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_lock_busted_write_unlock [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure cpumask_weight [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_lock [2018-11-10 04:02:20,723 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_print_module_parms [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure atomic_read [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock_irqrestore_8 [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_delay [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_cleanup [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_unlock [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_spin_lock [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock_irq [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kmalloc_12 [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock_irqrestore [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_torture_init [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_lock [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~TO~VOID [2018-11-10 04:02:20,724 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2018-11-10 04:02:20,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure torture_spin_lock_write_unlock [2018-11-10 04:02:20,725 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_alloc_flags [2018-11-10 04:02:20,744 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 450 nodes and edges [2018-11-10 04:02:20,746 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 184 nodes and edges [2018-11-10 04:02:20,747 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2018-11-10 04:02:20,748 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 04:02:20,749 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 04:02:20,776 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == ldv_spin) && lwsa == 0) && 1 == ldv_state_variable_0) || !(0 == \old(ldv_state_variable_2))) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(0 == onoff_interval)) || !(0 == \old(ldv_state_variable_1)) [2018-11-10 04:02:20,779 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,779 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || ((firsterr + 12 <= 0 && 0 == ldv_spin) && tmp___0 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || (((lwsa == 0 && 0 == ldv_spin) && lwsa == 0) && tmp___0 == 0)) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || (((lwsa == 0 && 0 == ldv_spin) && lwsa == 0) && tmp___0 == 0)) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || (((lwsa == 0 && 0 == ldv_spin) && lwsa == 0) && tmp___0 == 0)) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || (0 == ldv_spin && tmp___0 == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,780 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || (0 == ldv_spin && tmp___0 == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) [2018-11-10 04:02:20,884 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_53a38c68-9b3c-44a5-9a08-c0f58f225277/bin-2019/utaipan/witness.graphml [2018-11-10 04:02:20,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:02:20,885 INFO L168 Benchmark]: Toolchain (without parser) took 24396.79 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 547.4 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -208.4 MB). Peak memory consumption was 338.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,886 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:02:20,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,887 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.03 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,887 INFO L168 Benchmark]: Boogie Preprocessor took 65.51 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.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,887 INFO L168 Benchmark]: RCFGBuilder took 3889.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 930.5 MB in the end (delta: 158.9 MB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,887 INFO L168 Benchmark]: TraceAbstraction took 19508.78 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 288.9 MB). Free memory was 930.5 MB in the beginning and 1.2 GB in the end (delta: -257.3 MB). Peak memory consumption was 301.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,888 INFO L168 Benchmark]: Witness Printer took 175.57 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:02:20,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 67.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.03 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.51 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.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3889.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 96.5 MB). Free memory was 1.1 GB in the beginning and 930.5 MB in the end (delta: 158.9 MB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19508.78 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 288.9 MB). Free memory was 930.5 MB in the beginning and 1.2 GB in the end (delta: -257.3 MB). Peak memory consumption was 301.3 MB. Max. memory is 11.5 GB. * Witness Printer took 175.57 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2033]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 2707]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2179]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || (0 == ldv_spin && tmp___0 == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || ((firsterr + 12 <= 0 && 0 == ldv_spin) && tmp___0 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || (((lwsa == 0 && 0 == ldv_spin) && lwsa == 0) && tmp___0 == 0)) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || (0 == ldv_spin && tmp___0 == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || (((lwsa == 0 && 0 == ldv_spin) && lwsa == 0) && tmp___0 == 0)) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2329]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2452]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2179]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((((!(0 == ldv_state_variable_2) || !(0 == \old(lwsa))) || (((lwsa == 0 && 0 == ldv_spin) && lwsa == 0) && tmp___0 == 0)) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(1 == ldv_state_variable_0)) || !(0 == onoff_interval)) || !(0 == ldv_state_variable_1) - InvariantResult [Line: 2125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2707]: Loop Invariant Derived loop invariant: (((((((((((lwsa == 0 && ldv_state_variable_2 == 0) && ldv_state_variable_1 == 0) && 0 == ldv_spin) && lwsa == 0) && 1 == ldv_state_variable_0) || !(0 == \old(ldv_state_variable_2))) || !(0 == \old(lwsa))) || !(\old(ldv_spin) == 0)) || !(\old(lwsa) == 0)) || !(nwriters_stress + 1 == 0)) || !(0 == onoff_interval)) || !(0 == \old(ldv_state_variable_1)) - InvariantResult [Line: 2329]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 39 procedures, 346 locations, 1 error locations. SAFE Result, 19.4s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 6114 SDtfs, 3533 SDslu, 6657 SDs, 0 SdLazy, 300 SolverSat, 40 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6260occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 143 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 120 LocationsWithAnnotation, 12444 PreInvPairs, 12757 NumberOfFragments, 1909 HoareAnnotationTreeSize, 12444 FomulaSimplifications, 755 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 120 FomulaSimplificationsInter, 6447 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 130222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 264/264 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...